D. thesis in the Faculties of Exact Science, Mathematics, Agriculture and Medicine). In addition, Neyman won the Israeli under 20 chess championship in 1966. Research contributions Neyman has made numerous contributions to game theory, including to stochastic games, the Shapley value, and repeated games. Stochastic games Together with Jean-Francois Mertens, he proved the existence of the uniform value of zero-sum undiscounted stochastic games. This work is considered one of the most important works in the theory of stochastic games, solving a problem that had been open for over 20 years. Together with Elon Kohlberg, he applied operator techniques to study convergence properties of the discounted and finite stage values. Recently, he has pioneered a model of stochastic games in continuous time and derived uniform equilibrium existence results. He also co-edited, together with Sylvain Sorin, a comprehensive collection of works in the field of stochastic games. Repeated games Neyman has made many contributions to the theory of repeated games. One idea that appears, in different contexts, in some of his papers, is that the model of an infinitely repeated game serves also as a powerful paradigm for a long finitely repeated game. A related insight appears in a 1999 paper, where he showed that in a long finitely repeated game, an exponentially small deviation from common knowledge of the number of repetitions is enough to dramatically alter the equilibrium analysis, producing a folk-theorem-like result. Neyman is one of the pioneers and a most notable leader of the study of repeated games under complexity constraints. In his seminal paper he showed that bounded memory can justify cooperation in a finitely repeated prisoner's dilemma game. His paper was followed by many others who started working on bounded memory games. Most notable was Neyman's M.Sc. student Elchanan Ben-Porath who was the first to shed light on the strategic value of bounded complexity. The two main models of bounded complexity, automaton size and recall capacity, continued to pose intriguing open problems in the following decades. A major breakthrough was achieved when Neyman and his Ph.D. student Daijiro Okada proposed a new approach to these problems, based on information theoretic techniques, introducing the notion of strategic entropy. His students continued to employ Neyman's entropy technique to achieve a better understanding of repeated games under complexity constraints. Neyman's information theoretic approach opened new research areas beyond bounded complexity. A classic example is the communication game he introduced