Repeated Games with Forgetful Players∗
نویسنده
چکیده
We present a model to investigate the behavior of forgetful players in infinitely repeated games. We assume that each player may forget the entire history of the play with a fixed probability. Our modeling specifications make a clear distinction between absentminded and forgetful players. We consider two extreme cases regarding the correlation of forgetfulness of the players. In the first case, forgetfulness is simultaneous: If a player forgets, so do the rest. For this part, we are able to prove two Folk theorems. In the other extreme, we consider the case where forgetfulness is independent between players, so players’ state of memory is no longer common knowledge. We focus on Conditionally Belief-Free strategies to recapture the recursive structure in the sense of Abreu, Pearce and Stacchetti (1986, 1990). By utilizing a method analogous to Ely, Horner and Olszewski (2005), we represent characterization results for the payoff set of conditionally belief-free strategies. ∗I owe special thanks to my advisor David Pearce for his valuable comments and suggestions at all stages of this project. I also thank the participants at Micro Student Workshop (2006, New York University), the 17 International Conference on Game Theory, (2006, Stony Brook), and 2006 South and South East Asia Econometric Society Meeting (Chennai, India). †Department of Economics, New York University, 19 W. 4 Street, 6 FL. New York, NY 10012 (e-mail: [email protected])
منابع مشابه
Finitely repeated games with monitoring options
We study a model of finitely repeated games where the players can decide whether to monitor the other players’ actions or not each period. The standard model of repeated games can be interpreted as a model where the players automatically monitor each other. Monitoring is assumed to be private and costless. Hence it is weakly dominant to monitor the other players each period. We thus ask whether...
متن کاملRepeated Games with Observation Costs
This paper analyzes repeated games in which it is possible for players to observe the other players’ past actions without noise but it is costly. One’s observation decision itself is not observable to the other players, and this private nature of monitoring activity makes it difficult to give the players proper incentives to monitor each other. We provide a sufficient condition for a feasible p...
متن کاملDynamic system of strategic games
Maybe an event can't be modeled completely through one game but there is more chance with several games. With emphasis on players' rationality, we present new properties of strategic games, which result in production of other games. Here, a new attitude to modeling will be presented in game theory as dynamic system of strategic games and its some applications such as analysis of the clash betwe...
متن کاملSocial games: Matching and the play of finitely repeated games
We examine a new class of games, which we call social games, where players not only choose strategies but also choose with whom they play. A group of players who are dissatisfied with the play of their current partners can join together and play a new equilibrium. This imposes new refinements on equilibrium play, where play depends on the relative populations of players in different roles, amon...
متن کاملDivision of the Humanities and Social Sciences California Institute of Technology Pasadena, California 91125 Social Games: Matching and the Play of Finitely Repeated Games
We examine a new class of games, which we call social games, where players not only choose strategies but also choose with whom they play. A group of players who are dissatis ed with the play of their current partners can join together and play a new equilibrium. This imposes new re nements on equilibrium play, where play depends on the relative populations of players in di erent roles, among o...
متن کامل