@report {24527,
	title = {Demystifying the Math of the Coronavirus},
	year = {Working Paper},
	abstract = {We provide an elementary mathematical description of the spread of the coronavirus. We explain two\&nbsp;fundamental relationships: How the rate of growth in new infections is determined by the {\textquotedblleft}effective reproductive\&nbsp;number{\textquotedblright}; and how the effective reproductive number is affected by social distancing. By making a key\&nbsp;approximation, we are able to formulate these relationships very simply and thereby avoid complicated\&nbsp;mathematics. The same approximation leads to an elementary method for estimating the effective eproductivenumber.},
	author = {Elon Kohlberg and Abraham Neyman}
}
@workingpaper {21502,
	title = {The Big Match with a Clock and a Bit of Memory},
	year = {Working Paper},
	abstract = {\&nbsp;The Big Match is a multi-stage two-player game. In each stage Player 1 hides one or two pebbles in his hand, and his opponent has to guess that number; Player 1 loses a point if Player~2 is correct, and otherwise he wins a point. As soon as Player 1 hides one pebble, the players cannot change their choices in any future stage.Blackwell and Ferguson (1968) give an epsilon-optimal strategy for Player 1 that hides, in each stage, one pebble with a probability that depends on the entire past history. Any strategy that depends just on the clock\&nbsp; or\&nbsp;on a finite memory is worthless.The long-standing natural open problem has been whether every strategy that depends just on the clock and\&nbsp;a finite memory is worthless.The present paper proves that there is such a strategy that is epsilon-optimal.In fact, we show that just two states of memory are sufficient.\&nbsp;\&nbsp;},
	author = {Kristoffer A. Hansen and Rasmus Ibsen-Jensen and Abraham Neyman}
}
@article {24405,
	title = {The Big Match with a clock and a bit of memory},
	journal = {Mathematics of Operations Research },
	year = {In Press},
	abstract = {The Big Match is a multi-stage two-player game. In each stage Player 1 hides one or two pebbles in his\&nbsp;hand, and his opponent has to guess that number; Player 1 loses a point if Player 2 is correct, and otherwise\&nbsp;he wins a point. As soon as Player 1 hides one pebble, the players cannot change their choices in any future\&nbsp;stage.The undiscounted Big Match has been much-studied. Blackwell and Ferguson (1968) give an epsilon-optimalstrategy for Player 1 that hides, in each stage, one pebble with a probability that depends on the entire\&nbsp;past history. Any strategy that depends on just the clock or just a finite memory is worthless (i.e., cannot\&nbsp;guarantee strictly more than the least reward). The long-standing natural open problem has been whether every strategy that depends on just the clock and a nite memory is worthless.The present paper proves that there is such a strategy that is epsilon-optimal. In fact, we show that just two\&nbsp;states of memory are sfficient.},
	author = {Kristoffer A. Hansen and Rasmus Ibsen-Jensen and Abraham Neyman}
}
@article {25410,
	title = {Additive valuations of streams of payoffs that obey the time value of money principle: Characterization and robust optimization},
	year = {Submitted},
	abstract = {This paper characterizes the preferences over bounded infinite utility streams that satisfy the time value of money principle and an additivity property, and preferences that in addition are impatient. Based on this characterization, the paper introduces a concept of optimization that is robust to a small imprecision in the specification of the preference, and proves that the set of feasible streams of payoffs of a finite Markov decision process admits such a robust optimization.},
	author = {Abraham Neyman}
}
@article {24433,
	title = {Absorbing games with a clock and two bits of memory},
	journal = {Games and Economic Behavior},
	year = {Forthcoming},
	abstract = {\&nbsp;An absorbing game is a two-person zero-sum repeated game. Some of the entries are {\textquoteleft}{\textquoteleft}absorbing{\textquoteright}{\textquoteright} in the sense that, following the play of an absorbing entry, with positive probability all future payoffs are equal to that entry{\textquoteright}s payoff. The outcome of the game is the long-run average payoff.\&nbsp;We prove that a two-person zero-sum absorbing game, with either finite or compact action sets, has, for each e\&gt;0, e-optimal strategies with finite memory. In fact, we show that there is an e-optimal strategy that depends on the clock and three states of memory.},
	author = {K. A. Hansen and R. Ibsen-Jensen and A. Neyman}
}
@article {25173,
	title = {Cooperative Strategic Games},
	journal = {Theoretical Economics },
	volume = {16},
	year = {2021},
	month = {2021},
	pages = {825--851},
	abstract = {The value is a solution concept for n-person strategic games, developed by Nash,Shapley, and Harsanyi. The value of a game is an a priori evaluation of the economicworth of the position of each player, reflecting the players{\textquoteright} strategic possibilities,including their ability to make threats against one another. Applications\&nbsp;of the value in economics have been rare, at least in part because the existing definition\&nbsp;(for games with more than two players) consists of an ad hoc scheme that\&nbsp;does not easily lend itself to computation. This paper makes three contributions:\&nbsp;We provide an axiomatic foundation for the value; exhibit a simple formula for\&nbsp;its computation; and extend the value{\textemdash}its definition, axiomatic characterization,\&nbsp;and computational formula{\textemdash}to Bayesian games. We then apply the value in simple\&nbsp;models of corruption, oligopolistic competition, and information sharing.},
	author = {Elon Kohlberg and Abraham Neyman}
}
@article {3089,
	title = {Should I Remember more than you?? \&ndash; on the best response to factored based strategies},
	journal = {International Journal of Game Theory},
	volume = {49},
	number = {6},
	year = {2020},
	month = {2020},
	pages = {1105--1124},
	abstract = {In this paper we offer a new approach to modeling strategies of bounded complexity, the so-called factor-based strategies. In our model, the strategy of a player in the multi-stage game does not directly map the set of histories H to the set of her actions. Instead, the player{\textquoteright}s perception of H is represented by a factor ϕ : H {\textrightarrow} X, where X reflects the {\textquotedblleft}cognitive complexity{\textquotedblright} of the player. Formally, mapping ϕ sends each history to an element of a factor space X that represents its equivalence class. The play of the player can then be conditioned just on the elements of the set X. From the perspective of the original multi-stage game we say that a function ϕ from H to X is a factor of a strategy σ if there exists a function ω from X to the set of actions of the player such that σ = ω {\textopenbullet} ϕ. In this case we say that the strategy σ is ϕ-factorbased. Stationary strategies and strategies played by finite automata and strategies with bounded recall are the most prominent examples of factor-based strategies. In the discounted infinitely repeated game with perfect monitoring, a best reply to a profile of ϕ-factor-based strategies need not be a ϕ-factor-based strategy. However, if the factor ϕ is recursive, namely, its value ϕ(a(1), . . . , a(t)) on a finite string of action profiles (a(1), . . . , a(t)) is a function of ϕ(a(1), . . . , a(t-1)) and at, then for every profile of factor-based strategies there is a best reply that is a pure factor-based strategy. We also study factor-based strategies in the more general case of stochastic games.},
	url = {https://www.researchgate.net/publication/50252346_Should_I_remember_more_than_you_On_the_best_response_to_factor-based_strategies},
	author = {MIROSLAV ZELENY and Rene Levinsky and Abraham Neyman}
}
@article {19373,
	title = {Games of Threats.},
	journal = {Games and Economic Behavior},
	volume = {108},
	year = {2018},
	month = {2018},
	pages = {139--145.},
	abstract = {A game of threats on a finite set of players,\&nbsp;N, is a function\&nbsp;d\&nbsp;that assigns a real number to any coalition,\&nbsp;S⊆N, such that\&nbsp;d(S)=-d(N\S). A game of threats is not necessarily a coalitional game as it may fail to satisfy the condition\&nbsp;d(∅)=0. We show that analogs of the classic Shapley axioms for coalitional games determine a unique value for games of threats. This value assigns to each player an average of\&nbsp;d(S)\&nbsp;across all the coalitions that include the player. Games of threats arise naturally in\&nbsp;value theory\&nbsp;for strategic games, and may have applications in other branches\&nbsp;of game theory.},
	url = {https://www.sciencedirect.com/science/article/pii/S0899825617301902},
	author = {Elon Kohlberg and Abraham Neyman}
}
@article {13579,
	title = {Cooperative Strategic Games},
	journal = {The Federmann Center for the Study of Rationality, Hebrew University},
	volume = {DP 706},
	year = {2017},
	abstract = {The value\&nbsp;is a solution concept for n-person strategic games, developed by Nash, Shapley, and Harsanyi.\&nbsp;\&nbsp;The value\&nbsp;of a game is an\&nbsp;a priori evaluation of the economic worth of the position of each player, reflecting the players{\textquoteright} strategic possibilities, including their ability to make threats against one another.\&nbsp;Applications of the value in economics have been rare, at least in part because the existing definition (for games with more than two players)consists of an ad hoc scheme\&nbsp;that does not easily lend itself to computation.This paper makes three contributions: We provide an axiomatic foundation for the value; exhibit a simple formula for its computation; and extend the value -- its definition, axiomatic characterization, and computational formula -- to Bayesian games. We then apply the value in simple models of corruption, oligopolistic competition, and information sharing.\&nbsp;\&nbsp;We examine a solution concept, called the {\textquoteleft}{\textquoteleft}value," for n-person strategic games.In applications, the value provides an a-priori assessment of the monetary worth of a player{\textquoteright}s position in a strategic game, comprising not only the player{\textquoteright}s contribution to the total payoff but also the player{\textquoteright}s ability to inflict losses on other players. \&nbsp;A salient feature is that the value takes account of the costs that {\textquoteleft}{\textquoteleft}spoilers" impose on themselves.Our main result is an axiomatic characterization of the value.For every subset, S, consider the zero-sum game played between S and its complement, where the players in each of these sets collaborate as a single player, and where the payoff is the difference between the sum of the payoffs to the players in S and the sum of payoffs to the players not in S. \&nbsp; We say that S has an effective threat if the minmax value of this game is positive. The first axiom is that if no subset of players has an effective threat then all players are allocated the same amount.The second axiom is that if the overall payoff to the players in a game is the sum of their payoffs in two unrelated games then the overall value is the sum of the values in these two games.The remaining axioms are the strategic-game analogs of the classical coalitional-games axioms for the Shapley value: \&nbsp;efficiency, symmetry, and null player.\&nbsp;},
	author = {Abraham Neyman and Elon Kohlberg}
}
@article {11244,
	title = {Continuous-Time Stochastic Games.},
	journal = {Games and Economic Behavior},
	volume = {104},
	year = {2017},
	pages = {92-130},
	url = {https://ac.els-cdn.com/S0899825617300301/1-s2.0-S0899825617300301-main.pdf?_tid=5d1db742-c398-11e7-85bc-00000aacb360\&acdnat=1510044662_36ce4b7b16597a71095aa66463f3e977},
	author = {Abraham Neyman}
}
@manuascript {2909,
	title = {The Cooperative Solution of Stochastic Games},
	year = {2015},
	abstract = {Building on the work of Nash, Harsanyi, and Shapley, we define a cooperative solution for strategic games that takes account of both the competitive and the cooperative aspects of such games. We prove existence in the general (NTU) case and uniqueness in the TU case. Our main result is an extension of the definition and the existence and uniqueness theorems to stochastic games - discounted or undiscounted.},
	author = {Abraham Neyman and Elon Kohlberg}
}
@article {2180,
	title = {Online Concealed Correlation and Bounded Rationality},
	journal = {Games and Economic Behavior},
	year = {2014},
	pages = { 71 - 89},
	abstract = {Correlation of players{\textquoteright} actions may evolve in the common course of the play of a repeated game with perfect monitoring ({\textquotedblleft}online correlation{\textquotedblright}). In this paper we study the concealment of such correlation from a boundedly rational player. We show that {\textquotedblleft}strong{\textquotedblright} players, i.e., players whose strategic complexity is less stringently bounded, can orchestrate the online correlation of the actions of {\textquotedblleft}weak{\textquotedblright} players, where this correlation is concealed from an opponent of {\textquotedblleft}intermediate{\textquotedblright} strength. The feasibility of such {\textquotedblleft}online concealed correlation{\textquotedblright} is reflected in the individually rational payoff of the opponent and in the equilibrium payoffs of the repeated game. This result enables the derivation of a folk theorem that characterizes the set of equilibrium payoffs in a class of repeated games with boundedly rational players and a mechanism designer who sends public signals. The result is illustrated in two models, bounded recall strategies and finite automata.},
	author = {Abraham Neyman and Gilad Bavly}
}
@article {2310,
	title = {Stochastic Games with Short-Stage Duration},
	journal = {Dyn Games Appl},
	volume = {3},
	year = {2013},
	pages = {236-278},
	abstract = {We introduce asymptotic analysis of stochastic games with short-stage duration. The play of stage k, $k\geq 0$, of a stochastic game $\Gamma_\delta$ with stage duration $\delta$ is interpreted as the play in time $k\delta\leq t\&lt;(k+1)\delta$, and therefore the average payoff of the $n$-stage play per unit of time is the sum of the payoffs in the first $n$ stages divided by $n\delta$, and the $\lambda$-discounted present value of a payoff $g$ in stage $k$ is $\lambda^{k\delta} g$. We define convergence, strong convergence, and exact convergence of the data of a family $(\Gamma_\delta)_{\delta\&gt;0}$ as the stage duration $\delta$ goes to $0$, and study the asymptotic behavior of the value, optimal strategies, and equilibrium. The asymptotic analogs of the discounted, limiting-average, and uniform equilibrium payoffs are defined. Convergence implies the existence of an asymptotic discounted equilibrium payoff, strong convergence implies the existence of an asymptotic limiting-average equilibrium payoff, and exact convergence implies the existence of an asymptotic uniform equilibrium payoff.},
	author = {Abraham Neyman}
}
@article {2311,
	title = {The Maximal Variation of Martingales of Probabilities and Repeated Games with Incomplete Information},
	journal = {Journal of Theoretical Probability},
	year = {2013},
	pages = {557-567},
	abstract = {The variation of a martingale m[k] of k+1 probabilities p(0),...,p(k) on a finite (or countable) set X is the expectation of the sum of ||p(t)-p(t-1)|| (the L one norm of the martingale differences p(t)-p(t-1)), and is denoted V(m[k]). It is shown that V(m[k]) is less than or equal to the square root of 2kH(p(0)), where H(p) is the entropy function (the some over x in X of p(x)log p(x) and log stands for the natural logarithm. Therefore, if d is the number of elements of X, then V(m[k]) is less than or equal to the square root of 2k(log d). It is shown that the order of magnitude of this bound is tight for d less than or equal to 2 to the power k: there is C\&gt;0 such that for every k and d less than or equal to 2 to the power k there is a martingale m[k]=p(0),...,p(k) of probabilities on a set X with d elements, and with variation V(m[k]) that is greater or equal the square root of Ck(log d). It follows that the difference between the value of the k-stage repeated game with incomplete information on one side and with d states, denoted v(k), and the limit of v(k), as k goes to infinity, is bounded by the maximal absolute value of a stage payoff times the square root of 2(log d)/k, and it is shown that the order of magnitude of this bound is tight.},
	author = {Abraham Neyman}
}
@manuascript {3080,
	title = {Continuous-Time Stochastic Games},
	year = {2012},
	abstract = {Every continuous-time stochastic game with finitely many states and actions has a uniform and limiting-average equilibrium payoff.},
	author = {Abraham Neyman}
}
@article {2312,
	title = {The Value of Two-Person Zero-Sum Repeated Games with Incomplete Information and Uncertain Duration},
	journal = {International Journal of Game Theory},
	volume = {41},
	year = {2012},
	pages = {195-207},
	abstract = {It is known that the value of a zero-sum infinitely repeated game with incomplete information on both sides need not exist. It is proved that any number between the minmax and the maxmin of the zero-sum infinitely repeated game with incomplete information on both sides is the value of the long finitely repeated game where players{\textquoteright} information about the uncertain number of repetitions is asymmetric.},
	author = {Abraham Neyman}
}
@article {2360,
	title = {Singular Games in bv{\textquoteright}NA},
	journal = {Journal of Mathematical Economics},
	year = {2010},
	pages = {384 - 387},
	abstract = {Every simple game in bv{\textquoteright}NA is a weighted majority game, and every game in bv{\textquoteright}NA is a sume of a game in pNA and a convergent series of singular scalar measure games.},
	author = {Abraham Neyman}
}
@article {2314,
	title = {Complexity and Effective Prediction},
	journal = {Games and Economic Behavior},
	year = {2010},
	pages = {165-168},
	abstract = {Let G = be a two-person zero-sum game. We examine the two-person zero-sum repeated game G(k,m) in which players 1 and 2 place down finite state automata with k,m states respectively and the payoff is the average per-stage payoff when the two automata face off. We are interested in the cases in which player 1 is {\textquotedblleft}smart{\textquotedblright} in the sense that k is large but player 2 is {\textquotedblleft}much smarter{\textquotedblright} in the sense that m\&gt;\&gt;k. Let S(g) be the value of G where the second player is clairvoyant, i.e., would know the player 1{\textquoteright}s move in advance. The threshold for clairvoyance is shown to occur for m near min(|I|, | J |) to the power k. For m of roughly that size, in the exponential scale, the value is close to S(g). For m significantly smaller (for some stage payoffs g) the value does not approach S(g).},
	author = {Abraham Neyman and Joel Spencer}
}
@article {2313,
	title = {Repeated Games with Public Uncertain Duration Process},
	journal = {International Journal of Game Theory},
	year = {2010},
	pages = {29-52},
	abstract = {We consider repeated games where the number of repetitions u is unknown. The information about the uncertain duration can change during the play of the game. This is described by an uncertain duration process U that defines the probability law of the signals that players receive at each stage about the duration. To each repeated game G and uncertain duration process U is associated the U-repeated game G(U). A public uncertain duration process is one where the uncertainty about the duration is the same for all players. We establish a recursive formula for the value V_U of a repeated two-person zero-sum game G(U) with a public uncertain duration process U. We study asymptotic properties of the normalized value v_U = V_U/E(u) as the expected duration E(u) goes to infinity. We extend and unify several asymptotic results on the existence of lim v_n and lim v_{\"e} and their equality to lim v_U. This analysis applies in particular to stochastic games and repeated games of incomplete information.},
	author = {Abraham Neyman and Sylvain Sorin}
}
@article {2357,
	title = {Absorbing Games with Compact Action Spaces},
	journal = {Mathematics of Operations Research},
	volume = {34},
	year = {2009},
	pages = {257-262},
	abstract = {We prove that games with absorbing states with compact action sets have a value.},
	author = {Abraham Neyman and J. F. Mertens and D. Rosenberg}
}
@article {2358,
	title = {Growth of Strategy Sets, Entropy, and Nonstationary Bounded Recall},
	journal = {Games and Economic Behavior},
	year = {2009},
	pages = {404-425},
	abstract = {The paper initiates the study of long term interactions where players{\textquoteright} bounded rationality varies over time. Time dependent bounded rationality, for player i, is reflected in part in the number ψi(t) of distinct strategies available to him in the first t-stages. We examine how the growth rate of ψi(t) affects equilibrium outcomes of repeated games. An upper bound on the individually rational payoff is derived for a class of two-player repeated games, and the derived bound is shown to be tight. As a special case we study the repeated games with nonstationary bounded recall and show that, a player can guarantee the minimax payoff of the stage game, even against a player with full recall, by remembering a vanishing fraction of the past. A version of the folk theorem is provided for this class of games},
	author = {Abraham Neyman and Daijiro Okada}
}
@article {2359,
	title = {Existence of Optimal Strategies in Markov Games with Incomplete Information},
	journal = {International Journal of Game Theory},
	year = {2008},
	pages = {581 - 596},
	abstract = {The existence of a value and optimal strategies is proved for the class of two-person repeated games where the state follows a Markov chain independently of players{\textquoteright} actions and at the beginning of each stage only player one is informed about the state. The results apply to the case of standard signaling where players{\textquoteright} stage actions are observable, as well as to the model with general signals provided that player one has a nonrevealing repeated game strategy. The proofs reduce the analysis of these repeated games to that of classical repeated games with incomplete information on one side.},
	author = {Abraham Neyman}
}
@manuascript {2361,
	title = {Learning Effectiveness and Memory Size},
	journal = {Center for the Study of Rationality, Hebrew University.},
	volume = {DP 476},
	year = {2008},
	author = {Abraham Neyman}
}
@booklet {2902,
	title = {Lecture Notes: Mathematical Economics 2006/7},
	year = {2006},
	author = {Abraham Neyman}
}
@manuascript {2741,
	title = {Public Goods and Budget Deficit},
	journal = {Center for the Study of Rationality, Hebrew University.},
	year = {2006},
	abstract = {We examine incentive-compatible mechanisms for fair financing and efficient selection of a public budget (or public good). A mechanism selects the level of the public budget and imposes taxes on individuals. Individuals{\textquoteright} preferences are quasilinear. Fairness is expressed as weak monotonicity (called scale monotonicity) of the tax imposed on an individual as a function of his benefit from an increased level of the public budget. Efficiency is expressed as selection of a Pareto-optimal level of the public budget. The budget deficit is the difference between the public budget and the total amount of taxes collected from the individuals. We show that any efficient scale-monotonic and incentive-compatible mechanism may generate a budget deficit. Moreover, it is impossible to collect taxes that always cover a fixed small fraction of the total cost.},
	author = {Abraham Neyman and Tim Russo}
}
@article {2367,
	title = {Aumann Awarded Nobel Prize},
	journal = {Notices of the AMS},
	volume = {53},
	year = {2006},
	pages = {44 - 46},
	author = {Abraham Neyman}
}
@article {2362,
	title = {Optimal Use of Communication Resources},
	journal = {Econometrica},
	year = {2006},
	pages = {1603 - 1636},
	abstract = {We study a repeated game with asymmetric information about a dynamic state of nature. In the course of the game, the better informed player can communicate some or all of his information with the other. Our model covers costly and/or bounded communication. We characterize the set of equilibrium payoffs, and contrast these with the communication equilibrium payffs, which by definition entail no communication costs.},
	author = {Abraham Neyman and Olivier Gossner and Penelope Hernandez}
}
@booklet {2867,
	title = {Exam: Topics in game theory},
	year = {2005},
	author = {Abraham Neyman}
}
@booklet {2871,
	title = {Stochastic Games: Take home exam 2004},
	year = {2004},
	author = {Abraham Neyman}
}
@booklet {2870,
	title = {GT: Brouwer{\textquoteright}s FPT\&nbsp;},
	year = {2004},
	author = {Abraham Neyman}
}
@booklet {2869,
	title = {Exam Review},
	year = {2004},
	author = {Abraham Neyman}
}
@booklet {2868,
	title = {Supplementary notes},
	year = {2004},
	author = {Abraham Neyman}
}
@article {2369,
	title = {Asymptotic Values of Vector Measure Games},
	journal = {Mathematics of Operations Research},
	year = {2004},
	pages = {739 - 775},
	abstract = {The asymptotic value, introduced by Kannai in 1966, is an asymptotic approach to the notion of the Shapley value for games with infinitely many players. A vector measure game is a game v where the worth v(S) of a coalition S is a function f of u(S) where u is a vector measure. Special classes of vector measure games are the weighted majority games and the two-house weighted majority games, where a two-house weighted majority game is a game in which a coalition is winning if and only if it is winning in two given weighted majority games. All weighted majority games have an asymptotic value. However, not all two-house weighted majority games have an asymptotic value. In this paper, we prove that the existence of infinitely many atoms with sufficient variety suffice for the existence of the asymptotic value in a general class of nonsmooth vector measure games that includes in particular two-house weighted majority games.},
	author = {Abraham Neyman and Rann Smordinsky}
}
@article {2368,
	title = {Dynamiques de Communication},
	journal = {Dynamiques de Communication},
	volume = {55},
	year = {2004},
	pages = {509 - 516},
	author = {Abraham Neyman and Gossner Olivier and Penelope Hernandez}
}
@presentation {2903,
	title = {Online Information Transmission},
	year = {2003},
	author = {Abraham Neyman and Olivier Gossner and Penelope Hernandez}
}
@booklet {2901,
	title = {Chapter 1: Stochastic games},
	year = {2003},
	author = {L.S. SHAPLEY}
}
@booklet {2900,
	title = {Chapter 2: From Markov chains to stochastic games\&nbsp;},
	year = {2003},
	author = {Abraham Neyman}
}
@booklet {2899,
	title = {Chapter 3: Classification and basic tools},
	year = {2003},
	author = {Sylvain Sorin}
}
@booklet {2898,
	title = {Chapter 4: Stochastic games and stationary strategies},
	year = {2003},
	author = {O.J. VRIEZE}
}
@booklet {2897,
	title = {Chapter 5: Discounted stochastic games: The finite case},
	year = {2003},
	author = {Sylvain Sorin}
}
@booklet {2896,
	title = {Chapter 6: Real algebraic tools in stochastic games},
	year = {2003},
	author = {Abraham Neyman}
}
@booklet {2895,
	title = {Chapter 7: Zero-sum stochastic games with Borel state spaces},
	year = {2003},
	author = {ANDRZEJ S. NOWAK}
}
@booklet {2894,
	title = {Chapter 8: N-person stochastic games: Extensions of the finite state space case and correlation (2003)\&nbsp;},
	year = {2003},
	author = {ANDRZEJ S. NOWAK}
}
@booklet {2893,
	title = {Chapter 9: A measurable {\textquoteleft}{\textquoteleft}measurable choice{\textquoteright}{\textquoteright} theorem},
	year = {2003},
	author = {J. F. Mertens}
}
@booklet {2892,
	title = {Chapter 10: Equilibria for discounted stochastic games},
	year = {2003},
	author = {J. F. Mertens and T.E.S. PARTHASARATHY}
}
@booklet {2891,
	title = {Chapter 11: Stochastic games: Existence of the minmax},
	year = {2003},
	author = {Abraham Neyman}
}
@booklet {2890,
	title = {Chapter 12: The big match and the paris match},
	year = {2003},
	author = {FRANK THUIJSMAN}
}
@booklet {2889,
	title = {Chapter 13: Repeated games with absorbing states},
	year = {2003},
	author = {FRANK THUIJSMAN}
}
@booklet {2888,
	title = {Chapter 14: Stochastic games, practical motivation and the orderfield property for special classes},
	year = {2003},
	author = {O.J. VRIEZE}
}
@booklet {2887,
	title = {Chapter 15: Finite-step algorithms for single-controller and perfect information stochastic games},
	year = {2003},
	author = {T.E.S. RAGHAVAN}
}
@booklet {2886,
	title = {Chapter 16: Recursive games},
	year = {2003},
	author = {FRANK THUIJSMAN}
}
@booklet {2885,
	title = {Chapter 17: Perturbations of Markov chains with applications to stochastic games},
	year = {2003},
	author = {Eilon Solan}
}
@booklet {2884,
	title = {Chapter 18: Two-player non-zero-sum games: A reduction},
	year = {2003},
	author = {NICOLAS VIEILLE}
}
@booklet {2883,
	title = {Chapter 19: On a class of recursive games \&nbsp; \&nbsp;},
	year = {2003},
	author = {NICOLAS VIEILLE}
}
@booklet {2882,
	title = {Chapter 20: Uniform equilibrium: More than two players},
	year = {2003},
	author = {Eilon Solan}
}
@booklet {2881,
	title = {Chapter 21: Symmetric incomplete information games as stochastic games},
	year = {2003},
	author = {Sylvain Sorin}
}
@booklet {2880,
	title = {Chapter 22: Absorbing games with a signalling structure},
	year = {2003},
	author = {JEAN-MICHEL COULOMB}
}
@booklet {2879,
	title = {Chapter 23: Stochastic Games with lim sup Payoff},
	year = {2003},
	author = {A. MAITRA and W. SUDDERTH}
}
@booklet {2878,
	title = {Chapter 24: Stochastic Games with Borel Payoffs},
	year = {2003},
	author = {A. MAITRA and W. SUDDERTH}
}
@booklet {2877,
	title = {Chapter 25: Stochastic games with incomplete information},
	year = {2003},
	author = {Sylvain Sorin}
}
@booklet {2876,
	title = {Chapter 26: Stochastic games and nonexpansive maps},
	year = {2003},
	author = {Abraham Neyman}
}
@booklet {2875,
	title = {Chapter 27: The operator approach to zero-sum stochastic games},
	year = {2003},
	author = {Sylvain Sorin}
}
@booklet {2874,
	title = {Chapter 28: Games with a recursive structure},
	year = {2003},
	author = {JEAN-MICHEL COULOMB}
}
@booklet {2873,
	title = {Chapter 29: Stochastic games in economics: The lattice-theoretic approach},
	year = {2003},
	author = {RABAH AMIR}
}
@booklet {2872,
	title = {Chapter 30: Stochastic games in economics and related fields: An overview},
	year = {2003},
	author = {RABAH AMIR}
}
@inbook {2734,
	title = {From Markov chains to stochastic games\&nbsp;},
	booktitle = {Kluwer Academic Publishers },
	year = {2003},
	pages = {9--25},
	publisher = {Kluwer Academic Publishers},
	organization = {Kluwer Academic Publishers},
	edition = {2003},
	address = {Dordrecht / Boston / London},
	author = {Abraham Neyman},
	editor = {Abraham Neyman and Sylvain Sorin}
}
@inbook {2733,
	title = {Stochastic games: Existence of the minmax\&nbsp;},
	booktitle = {Kluwer Academic Publishers},
	year = {2003},
	pages = {173--193},
	publisher = {Kluwer Academic Publishers},
	organization = {Kluwer Academic Publishers},
	author = {Abraham Neyman},
	editor = {Abraham Neyman and Sylvain Sorin}
}
@inbook {2732,
	title = {Real algebraic tools in stochastic games\&nbsp;},
	booktitle = {Kluwer Academic Publishers},
	year = {2003},
	pages = {58--75.},
	publisher = {Kluwer Academic Publishers},
	organization = {Kluwer Academic Publishers},
	author = {Abraham Neyman},
	editor = {Abraham Neyman and Sylvain Sorin}
}
@inbook {2731,
	title = {Stochastic games and nonexpansive maps\&nbsp;},
	booktitle = {Stochastic Games},
	year = {2003},
	pages = {397--415.},
	publisher = {Kluwer Academic Publishers},
	organization = {Kluwer Academic Publishers},
	author = {Abraham Neyman},
	editor = {Abraham Neyman and Sylvain Sorin}
}
@article {2735,
	title = {A value on {\textquoteleft}AN},
	journal = {International Journal of Game Theory},
	year = {2003},
	pages = { 109-120},
	abstract = {We prove here the existence of a value (of norm 1) on the spaces {\textquoteright}NA and even {\textquoteright}AN, the closure in the variation distance of the linear space spanned by all games f{\textdegree}{\textmu}, where {\textmu} is a non-atomic, non-negative finitely additive measure of mass 1 and f a real-valued function on [0,1] which satisfies a much weaker continuity at zero and one.},
	author = {Abraham Neyman and J. F. Mertens}
}
@manuascript {2736,
	title = {Online Concealed Correlation by Boundedly Rational Players},
	journal = {Center for the Study of Rationality, DP336},
	year = {2003},
	pages = {DP-336},
	abstract = {In a repeated game with perfect monitoring, correlation among a group of players may evolve in the common course of play (online correlation). Such a correlation may be concealed from a boundedly rational player. The feasibility of such online concealed correlation{\textquoteright}{\textquoteright} is quantified by the individually rational payoff of the boundedly rational player. We show that {\textquoteleft}{\textquoteleft}strong{\textquoteright}{\textquoteright} players, i.e., players whose strategic complexity is less stringently bounded, can orchestrate online correlation of the actions of {\textquoteleft}{\textquoteleft}weak{\textquoteright}{\textquoteright} players, in a manner that is concealed from an opponent of {\textquoteleft}{\textquoteleft}intermediate{\textquoteright}{\textquoteright} strength. The result is illustrated in two models, each captures another aspect of bounded rationality. In the first, players use bounded recall strategies. In the second, players use strategies that are implementable by finite automata.},
	author = {Abraham Neyman and Gilad Bavly}
}
@manuascript {2737,
	title = {Online Matching Pennies},
	journal = {Center for the Study of Rationality, Discussion Paper 316 },
	year = {2003},
	abstract = {We study a repeated game in which one player, the prophet, acquires more information than another player, the follower, about the play that is going to be played. We characterize the optimal amount of information that can be transmitted online by the prophet to the follower, and provide applications to repeated games played by finite automata, and by players with bounded recall.},
	author = {Olivier Gossner and Penelope Hernandez and Abraham Neyman}
}
@book {2738,
	title = {Stochastic Games and Applications},
	year = {2003},
	publisher = {Kluwer Academic Publishers},
	organization = {Kluwer Academic Publishers},
	edition = {NATO ASI series},
	author = {Abraham Neyman and Sylvain Sorin}
}
@inbook {2742,
	title = {Values of Games with Infinitely Many Players},
	booktitle = {Handbook of Game Theory, with Economic Applications},
	volume = {3},
	year = {2002},
	pages = {2121--2167.},
	publisher = {North-Holland},
	organization = {North-Holland},
	address = {Amsterdam},
	author = {Abraham Neyman},
	editor = {Roberth J. Aumann and sergiu hart}
}
@article {2743,
	title = {Values of Non-Atomic Vector Measure Games},
	journal = {Israel Journal of Mathematics},
	volume = {124},
	year = {2001},
	pages = {1-27},
	abstract = {Much of economic theory is concerned with the existence of prices. In particular, economists are interested in whether various outcomes defined by diverse postulates turn out to be actually generated by prices. Whenever this is the case, a theory of endogenous price formation is derived. In the present analysis, a well-known game-theoretic solution concept is considered: value. Nonatomic games are considered that are defined by finitely many nonnegative measures. Nonatomic vector measure games arise, for example, from production models and from finite-type markets. It is shown that the value of such a game need not be a linear combination of the nonatomic nonnegative measures. This is in contrast to all the values known to date. Moreover, this happens even for certain differentiable market games. In the economic models, this means that the value allocations are not necessarily produced by prices. All the examples presented are special cases of a new class of values.},
	author = {Abraham Neyman}
}
@article {2751,
	title = {Repeated games with bounded entropy},
	journal = {Games and Economic Behavior},
	volume = {30},
	year = {2000},
	pages = {228--247},
	abstract = {We investigate the asymptotic behavior of the maxmin values of repeated two-person zero-sum games with a bound on the strategic entropy of the maximizer{\textquoteright}s strategies while the other player is unrestricted. We will show that if the bound (n), a function of the number of repetitions n, satisfies the condition (n)/n (n), then the maxmin value Wn ((n)) converges to (cavU)(), the concavification of the maxmin value of the stage game in which the maximizer{\textquoteright}s actions are restricted to those with entropy at most . A similar result is obtained for the infinitely repeated games.},
	author = {Abraham Neyman and Daijiro Okada}
}
@article {2744,
	title = {Two-person repeated games with finite automata},
	journal = {International Journal of Game Theory},
	volume = {29},
	year = {2000},
	pages = {309--325},
	abstract = {We study two-person repeated games in which a player with a restricted set of strategies plays against an unrestricted player. An exogenously given bound on the complexity of strategies, which is measured by the size of the smallest automata that implement them, gives rise to a restriction on strategies available to a player. We examine the asymptotic behavior of the set of equilibrium payoffs as the bound on the strategic complexity of the restricted player tends to infinity, but sufficiently slowly. Results from the study of zero sum case provide the individually rational payoff levels.},
	author = {Abraham Neyman and Daijiro Okada}
}
@article {2752,
	title = {A strong law of large numbers for nonexpansive vector-valued stochastic processes},
	journal = {Israel Journal of Mathematics},
	volume = {111},
	year = {1999},
	pages = {93-108},
	author = {Elon Kohlberg and Abraham Neyman}
}
@article {2754,
	title = {Cooperation in Repeated Games when the Number of Stages is not Commonly Known},
	journal = {Econometrica},
	volume = {67},
	year = {1999},
	pages = {45--64},
	abstract = {It is shown that an exponentially small departure from the common knowledge assumption on the number T of repetitions of the prisoners{\textquoteright} dilemma already enables cooperation. More generally, with such a departure, any feasible individually rational outcome of any one-shot game can be ap},
	author = {Abraham Neyman}
}
@article {2753,
	title = {Strategic entropy and complexity in repeated games},
	journal = {Games and Economic Behavior},
	volume = {29},
	year = {1999},
	pages = {191--223},
	abstract = {We introduce the entropy-based measure of uncertainty for mixed strategies of repeated games-strategic entropy. We investigate the asymptotic behavior of the maxmin values of repeated two-person zero-sum games with a bound on the strategic entropy of player 1{\textquoteright}s strategies while player 2 is unrestricted, as the bound grows to infinity. We apply the results thus obtained to study the asymptotic behavior of the value of the repeated games with finite automata and bounded recall.},
	author = {Abraham Neyman and Daijiro Okada}
}
@article {2756,
	title = {Equilibria in Repeated Games with Incomplete Information: The General Symmetric Case},
	journal = {International Journal of Game Theory},
	volume = {27},
	year = {1998},
	pages = { 201--210},
	abstract = {Every two person repeated game of symmetric incomplete information, in which the signals sent at each stage to both players are identical and generated by a state and moves dependent probability distribution on a given finite alphabet, has an equilibrium payoff.},
	author = {Abraham Neyman and Sylvain Sorin}
}
@article {2755,
	title = {Finitely Repeated Games with Finite Automata},
	journal = {Mathematics of Operations Research},
	volume = {23},
	year = {1998},
	pages = {513--552},
	abstract = {Every two person repeated game of symmetric incomplete information, in which the signals sent at each stage to both players are identical and generated by a state and moves dependent probability distribution on a given finite alphabet, has an equilibrium payoff.},
	author = {Abraham Neyman}
}
@article {2820,
	title = {Correlated Equilibrium and Potential Games},
	journal = {International Journal of Game Theory},
	volume = {26},
	year = {1997},
	pages = { 223--227.},
	abstract = {Any correlated equilibrium of a strategic game with bounded payoffs and convex strategy sets which has a smooth concave potential, is a mixture of pure strategy profiles which maximize the potential. If moreover, the strategy sets are compact and the potential is strictly concave, then the game has a unique correlated equilibrium.},
	author = {Abraham Neyman}
}
@inbook {2758,
	title = {Cooperation, Repetition and Automata},
	booktitle = {Cooperation: Game-Theoretic Approaches, NATO ASI Series},
	volume = {155},
	year = {1997},
	pages = {233--255},
	author = {Abraham Neyman},
	editor = {sergiu hart and Andreu Mas-Colell}
}
@article {2757,
	title = {Equilibria in Repeated Games with Incomplete Information: The Deterministic Symmetric Case},
	journal = {Kluwer Academic Publishers },
	year = {1997},
	pages = {129--131.},
	author = {Abraham Neyman and Sylvain Sorin}
}
@book {2739,
	title = {Games and Economic Theory: Selected Contributions in Honor of Robert J. Aumann},
	year = {1995},
	publisher = {The University of Michigan Press},
	organization = {The University of Michigan Press},
	address = {Michigan },
	author = {Abraham Neyman and sergiu hart}
}
@inbook {3084,
	title = {Values of Games with a Continuum of Players},
	booktitle = {Game-Theoretic Methods in General Equilibrium Analysis},
	year = {1994},
	pages = {67--79},
	publisher = {Kluwer Academic Publishers},
	organization = {Kluwer Academic Publishers},
	address = {Amsterdam},
	author = {Abraham Neyman},
	editor = {Jean-Francois Mertens and Sylvain Sorin}
}
@article {2823,
	title = {Value of Games with a Continuum of Players},
	journal = {Game-Theoretic Methods in General Equilibrium Analysis},
	volume = {77},
	year = {1994},
	pages = {67--79}
}
@inbook {2822,
	title = {An Axiomatic Approach to the Equivalence Phenomenon},
	booktitle = {Game-Theoretic Methods in General Equilibrium Analysis},
	volume = {77},
	year = {1994},
	pages = {137--143},
	publisher = {Kluwer Academic Publishers},
	organization = {Kluwer Academic Publishers},
	address = {Dordrecht / Boston / London},
	author = {Pradeep Dubey and Abraham Neyman},
	editor = {Jean-Francois Mertens and Sylvain Sorin}
}
@article {2821,
	title = {An Equivalence Principle for Perfectly Competitive Economies},
	journal = {Journal of Economic Theory},
	volume = {75},
	year = {1994},
	pages = {314-344},
	abstract = {Four axioms are placed on a correspondence from smooth, non-atomic economies to their allocations. We show that the axioms categorically determine the (coincident) competitive-core-value correspondence. Thus any solution is equivalent to the above three if, and only if, it satisfies the axioms. In this sense our result is tantamount to an "equivalence principle." At the same time, our result implies that the three solutions themselves are determined by the axioms and so serves as an axiomatic characterization of the well-known competitive (or core, or value) correspondence.},
	author = {Abraham Neyman and Pradeep Dubey}
}
@article {2824,
	title = {The Positive Value of Information},
	journal = {Games and Economic Behavior},
	volume = {3},
	year = {1991},
	pages = {350-355},
	abstract = {It has been remarked that in rational interactions more information to one player, while all others{\textquoteright} information remains the same, may reduce his payoff in equilibrium. This classical observation relies on comparing equilibria of two different games. It is argued that this analysis is not tenably performed by comparing equilibria of two different games. Rather, one is compelled to perform the analysis in an interaction without complete information, and to compare equilibria of two interactions that are embedded in some compounded game. It is then shown that the player whose information is unilaterally refined cannot be worse off at equilibrium.\&nbsp;},
	author = {Abraham Neyman}
}
@article {2825,
	title = {On Non-Atomic Weighted Majority Games},
	journal = {Journal of Mathematical Economics},
	volume = {19},
	year = {1990},
	pages = {391-403},
	author = {Abraham Neyman and Ezra.Einy}
}
@book {2740,
	title = {Game Theory and Applications},
	year = {1990},
	publisher = {Harcourt Brace Jovanovich,},
	organization = {Harcourt Brace Jovanovich,},
	edition = {Academic Press},
	author = {Abraham Neyman and T. Ichiishi and Y. Tauman}
}
@article {2827,
	title = {Large Symmetric Games are Characterized by Completeness of the Desirability Relation},
	journal = {Journal of Economic Theory},
	volume = {148},
	year = {1989},
	pages = {369-385},
	author = {E.Einy and Abraham Neyman}
}
@article {2826,
	title = {Uniqueness of the Shapley Value},
	journal = {Games and Economic Behavior},
	volume = {1},
	year = {1989},
	pages = {116-118},
	abstract = {It is shown that the Shapley value of any given game v is characterized by applying the value axioms -- efficiency, symmetry, the null player axiom, and either additivity or strong positivity -- to the additive group generated by the subgames of v.},
	author = {Abraham Neyman}
}
@article {2865,
	title = {Values of Vector Measure Games: Are They Linear Combinations of the Measures?},
	journal = {Journal of Mathematical Economics},
	volume = {17},
	year = {1988},
	pages = {31-40},
	author = {Abraham Neyman and sergiu hart}
}
@article {2828,
	title = {Weighted Majority Games have an Asymptotic Value},
	journal = {Mathematics of Operations Research},
	volume = {13},
	year = {1988},
	pages = {556-580},
	author = {Abraham Neyman}
}
@article {2829,
	title = {Payoffs in Non-Atomic Games: An Axiomatic Approach},
	journal = {The Shapley Value, A. Roth (ed.), Cambridge Univ. Press},
	year = {1988},
	pages = {207-216.},
	author = {Abraham Neyman and Pradeep Dubey}
}
@article {2830,
	title = {Values of Smooth Non-Atomic Games: The Method of Multilinear Approximation},
	journal = {The Shapley Value, A. Roth (ed.), Cambridge Univ. Press},
	year = {1988},
	pages = {217-234},
	author = {Abraham Neyman and Dov Monderer}
}
@article {2831,
	title = {Power and Public Goods},
	journal = {Journal of Economic Theory},
	volume = {42},
	year = {1987},
	pages = {108-127},
	author = {Robert J. Aumann and M. Kurtz and Abraham Neyman}
}
@article {2832,
	title = {A Counter-Example to the Folk Theorem with Discounting},
	journal = {Economic Letters},
	volume = {19},
	year = {1986},
	pages = {227-229},
	author = {F. Forges and J. F. Mertens and Abraham Neyman}
}
@article {2840,
	title = {Bounded Complexity Justifies Cooperation in the Finitely Repeated Prisoner{\textquoteright}s Dilemma},
	journal = {Economic Letters},
	volume = {19},
	year = {1985},
	pages = {227-229},
	author = {Abraham Neyman}
}
@article {2844,
	title = {Diagonality of Cost Allocation Prices},
	journal = {Mathematics of Operations Research},
	volume = {9},
	year = {1984},
	pages = {66-74},
	author = {Leonard J. Mirman and Abraham Neyman}
}
@article {2843,
	title = {Payoffs of Non-Atomic Markets: An Axiomatic Approach},
	journal = {Econometrica},
	volume = {52},
	year = {1984},
	pages = {1129-1150},
	author = {Pradeep Dubey and Abraham Neyman}
}
@article {2842,
	title = {Representation of Lp-Norms and Isometric Embedding in Lp-Spaces},
	journal = {Israel Journal of Mathematics},
	volume = {48},
	year = {1984},
	pages = {129-138.},
	author = {Abraham Neyman}
}
@article {2841,
	title = {Semi-Values of Political Economic Games},
	journal = {Mathematics of Operations Research},
	volume = {10},
	year = {1984},
	pages = {390-402},
	abstract = {The class of continuous semivalues is completely characterized for various spaces of nonatomic games.},
	author = {Abraham Neyman}
}
@article {2847,
	title = {Convergence in Hilbert{\textquoteright}s Metric and Convergence in Directions},
	journal = {Journal of Mathematical Analysis and Applications},
	volume = {93},
	year = {1983},
	pages = {104-108},
	author = {E. Kohlberg and Abraham Neyman}
}
@article {2845,
	title = {Prices for Homogeneous Cost Functions},
	journal = {Journal of Mathematical Economics},
	volume = {12},
	year = {1983},
	pages = {257-273},
	abstract = {The problem of allocating the production cost of a finite bundle of infinitely divisible consumption goods by means of prices is a basic problem in economics. This paper extends the recent axiomatic approach in which one considers a class of cost problems and studies the maps from the class of cost problems to prices by means of the properties these prices satisfy. The class of continuously differentiable costs functions used in previous studies is narrowed to the subclass containing non-decreasing, homogeneous of degree one and convex functions. On this subclass it is shown that there exists a unique continuous price mechanism satisfying axioms similar to those assumed in previous studies.},
	author = {Leonard J. Mirman and Abraham Neyman}
}
@article {2846,
	title = {Voting for Public Goods},
	journal = {Review of Economic Studies},
	volume = {50},
	year = {1983},
	pages = {677-693},
	abstract = {It is shown that when resources are privately owned, the institution of voting is irrelevant to the choice of non-exclusive public goods: the total bundle of such goods produced by Society is the same whether or not minority coalitions are permitted to produce them. This is in sharp contrast to the cases of redistribution and of exclusive public goods, where public decisions depend strongly on the vote. The analytic tool used is the Harsanyi-Shapley non-transferable utility value.},
	author = {Robert J. Aumann and M. Kurtz and Abraham Neyman}
}
@article {2849,
	title = {Nim-Type Games},
	journal = {International Journal of Game Theory},
	volume = {11},
	year = {1982},
	pages = {17-20},
	author = {D. Gale and Abraham Neyman}
}
@article {2850,
	title = {Integrals of Production Sets with Restricted Substitution},
	journal = {Journal of Mathematical Economics},
	volume = {9},
	year = {1982},
	pages = {71-82},
	abstract = {It is well known that the set of all zonoids (integrals of line segments) in R" (n\&gt;2) is a closed\&nbsp;and nowhere defise subset in the space of all compact, convex and centrally symmetric subsets of\&nbsp;R". We generalize this result to sets which are the integral of k-dimensional convex sets, k \&lt;n.},
	author = {Abraham Neyman and Werner Hildenbrand}
}
@article {2848,
	title = {Stochastic Games have a Value},
	journal = {Proceedings of the National Academy of Sciences},
	volume = {79},
	year = {1982},
	pages = {2145-2146},
	abstract = {Undiscounted nontenninating stochastic games in which the state and action spaces are finite have a value.},
	author = {J. F. Mertens and Abraham Neyman}
}
@article {2851,
	title = {Renewal Theory for Sampling without Replacement},
	journal = {Annals of Probability},
	volume = {10},
	number = {2},
	year = {1982},
	pages = {464--481},
	url = {https://projecteuclid.org/download/pdf_1/euclid.aop/1176993870},
	author = {Abraham Neyman}
}
@article {2853,
	title = {Minimax Theorems for Undiscounted Stochastic Games},
	journal = {Game Theory and Mathematical Economics},
	year = {1981},
	pages = {83-87},
	author = {J.-F. Mertens and Abraham Neyman}
}
@article {2852,
	title = {Decomposition of Ranges of Vector Measures},
	journal = {Israel Journal of Mathematics},
	volume = {40},
	year = {1981},
	pages = {54-64},
	author = {Abraham Neyman}
}
@article {2856,
	title = {Asymptotic Behavior of Nonexpansive Mappings in Normed Linear Spaces},
	journal = {Israel Journal of Mathematics},
	volume = {38},
	year = {1981},
	pages = {269-275},
	abstract = {Let T be a non expansive mapping on a normed linear space X. We show that there exists a linear functional f, with ||f|| = 1, such that, for all x in X, the Iimit, as n goes to infinity, of \&nbsp;f(T"x/n) equals the limit of IIT"x/nll=a, where a=inf_{y}IITy-yli. This means, if X is reflexive, that there is a face F of the ball of radius a to which T"x/n converges weakly to F for all x \&nbsp;if X is strictly convex as well as reflexive, the convergence is to a point; and if X satisfies the stronger condition that its dual has Frechet differentiable norm then the convergence is strong. Furthermore, we show that each of the foregoing conditions on X is satisfied if and only if the associated convergence property holds for all nonexpansive T.},
	author = {Elon Kohlberg and Abraham Neyman}
}
@article {2854,
	title = {Asymptotic Behavior of Nonexpansive Mappings in Uniformly Convex Banach Spaces},
	journal = {American Mathematical Monthly},
	volume = {88},
	year = {1981},
	pages = {698-700},
	author = {Elon Kohlberg and Abraham Neyman}
}
@article {2857,
	title = {Singular Games have Asymptotic Values},
	journal = {Mathematics of Operations Research},
	volume = {6},
	year = {1981},
	pages = {205-212},
	abstract = {The asymptotic value of a game v with a continuum of players is defined whenever all the sequences of Shapley values of finite games that "approximate" v have the same limit. In this paper we prove that if v is defined by v(S) = f( p(S)), where p is a nonatomic probability measure and f is a function of bounded variation on [0, I] that is continuous at 0 and at I, then v has an asymptotic value. This had previously been known only when v is absolutely continuous. Thus, for example, our result implies that the nonatomic majority voting game, defined by v(S) = 0 or I according as p(S) \&nbsp;less than or equal to 1/2 or p(S) \&gt; 1/2, has an asymptotic value. We also apply our result to show that other games of interest in economics and political science have asymptotic values, and adduce an example to show that the result cannot be extended to functions f that are not of bounded variation.},
	author = {Abraham Neyman}
}
@article {2855,
	title = {Stochastic Games},
	journal = {International Journal of Game Theory},
	volume = {10},
	year = {1981},
	pages = {53-66},
	abstract = {Stochastic Games have a value.},
	author = {J. F. Mertens and Abraham Neyman}
}
@article {2858,
	title = {Value Theory without Efficiency},
	journal = {Mathematics of Operations Research},
	volume = {6},
	year = {1981},
	pages = {122--128},
	abstract = {A semivalue is a symmetric positive linear operator on a space of games, which leaves the additive games fixed. Such an operator satisfies all of the axioms defining the Shapley value, with the possible exception of the efficiency axiom. The class of semivalues is completely characterized for the space of finite-player games, and for the space pNA of nonatomic games.},
	author = {Abraham Neyman and Pradeep Dubey and Roberth J. Weber}
}
@proceedings {2859,
	title = {Asymptotic Values of Mixed Games},
	journal = {Game Theory and Related Topics},
	year = {1979},
	pages = {71-81},
	author = {Abraham Neyman}
}
@article {2860,
	title = {The Partition Value},
	journal = {Mathematics of Operations Research},
	volume = {2},
	year = {1979},
	pages = {236-267},
	author = {Abraham Neyman and Yair Tauman}
}
@article {2861,
	title = {Continuous Values are Diagonal},
	journal = {Mathematics of Operations Research},
	volume = {2},
	year = {1977},
	pages = {338-342.},
	abstract = {It is. proved that every continuous value is. diagonal, which in particular implies that every value on a closed reproducing space is diagonaL We deduce als.o that there are noncontinuous values.},
	author = {Abraham Neyman}
}
@conference {2863,
	title = {The Limiting Behavior of the Shapley Value in a Class of Games with Many Players},
	booktitle = {Cahiers du Centre d{\textquoteright}Etudes de Recherche Operationelle},
	volume = {18},
	year = {1976},
	pages = {161},
	author = {Abraham Neyman}
}
@article {2862,
	title = {The Existence of Non-Diagonal Axiomatic Values},
	journal = {Mathematics of Operations Research},
	volume = {1},
	year = {1976},
	pages = {246--250},
	author = {Abraham Neyman and Yair Tauman}
}
