Showing 1 - 10 of 12
Consider a finite, normal form game G in which each player position is occupied by a population of N individuals, and the payoff to any given individual is the expected payoff from playing against a group drawn at random from the other positions.  Assume that individuals adjust their behavior...
Persistent link: https://www.econbiz.de/10009320223
In 1995, Aumann showed that in games of perfect information, common knowledge of rationality is consistent and entails the back- ward induction (BI) outcome. That work has been criticized because it uses "counterfactual" reasoning|what a player "would" do if he reached a node that he knows he...
Persistent link: https://www.econbiz.de/10008562714
Persistent link: https://www.econbiz.de/10005708193
Persistent link: https://www.econbiz.de/10005827960
Infinite sequential games, in which Nature chooses a Borel winning set and reveals it to one of the players, do not necessarily have a value if Nature has 3 or more choices. The value does exist if Nature has 2 choices. The value also does not necessarily exist if Nature chooses from 2 Borel...
Persistent link: https://www.econbiz.de/10008469393
Persistent link: https://www.econbiz.de/10005752800
R. J. Aumann and J. H. Drèze (2008) define a rational expectation of a player i in a game G as the expected payo of some type of i in some belief system for G in which common knowledge of rationality and common priors obtain. Our goal is to characterize the set of rational expectations in terms...
Persistent link: https://www.econbiz.de/10005752820
The logic of backward induction (BI) in perfect information (PI) games has been intensely scrutinized for the past quarter century. A major development came in 2002, when P. Battigalli and M. Sinischalchi (BS) showed that an outcome of a PI game is consistent with common strong belief of utility...
Persistent link: https://www.econbiz.de/10010714082
Persistent link: https://www.econbiz.de/10009149568
Define a continuous game to be one in which every player's strategy set is a Polish space, and the payoff function of each player is bounded and continuous. We prove that in this class of games the process of sequentially eliminating "never-best-reply" strategies terminates before or at the...
Persistent link: https://www.econbiz.de/10008870878