Infinite Histories and Steady Orbits in Repeated Games
We study a model of repeated games with the following features: (a) Infinite histories. The game has been played since days of yore, or is so perceived by the players: (b) Turing machines with memory. Since regular Turing machines coincide with bounded recall strategies (in the presence of infinite histories), we endow them with "external" memory; (c) Nonstrategic players. The players ignore complicated strategic considerations and speculations about them. Instead, each player uses his/her machine to update some statistics regarding the others′ behaviour, and chooses a best response to observed behaviour. Relying on these assumptions, we define a solution concept for the one shot game, called steady orbit. The (closure of the) set of steady orbit payoffs strictly includes the convex hull of the Nash equilibria payoffs and is strictly included in the correlated equilibria payoffs. Assumptions (a)-(c) above are independent to a large extent. In particular, one may define steady orbits without explicitly dealing with histories or machines.
(This abstract was borrowed from another version of this item.)
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- AUMANN, Robert J., .
"Subjectivity and correlation in randomized strategies,"
CORE Discussion Papers RP
167, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Aumann, Robert J., 1974. "Subjectivity and correlation in randomized strategies," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 67-96, March.
- R. Aumann, 2010. "Subjectivity and Correlation in Randomized Strategies," Levine's Working Paper Archive 389, David K. Levine.
- Aumann, Robert J. & Sorin, Sylvain, 1989. "Cooperation and bounded recall," Games and Economic Behavior, Elsevier, vol. 1(1), pages 5-39, March.
- Itzhak Gilboa, 1988.
"The Complexity of Computing Best-Response Automata in Repeated Games,"
- Gilboa, Itzhak, 1988. "The complexity of computing best-response automata in repeated games," Journal of Economic Theory, Elsevier, vol. 45(2), pages 342-352, August.
- Itzhak Gilboa & Dov Samet, 1989.
"Bounded Versus Unbounded Rationality: The Tyranny of the Weak,"
- Gilboa, Itzhak & Samet, Dov, 1989. "Bounded versus unbounded rationality: The tyranny of the weak," Games and Economic Behavior, Elsevier, vol. 1(3), pages 213-221, September.
- Lehrer, Ehud, 1988. "Repeated games with stationary bounded recall strategies," Journal of Economic Theory, Elsevier, vol. 46(1), pages 130-144, October.
- Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
- Kalai, Ehud & Stanford, William, 1988.
"Finite Rationality and Interpersonal Complexity in Repeated Games,"
Econometric Society, vol. 56(2), pages 397-410, March.
- Ehud Kalai & William Stanford, 1986. "Finite Rationality and Interpersonal Complexity in Repeated Games," Discussion Papers 679, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Ariel Rubinstein, 1997.
"Finite automata play the repeated prisioners dilemma,"
Levine's Working Paper Archive
1639, David K. Levine.
- Rubinstein, Ariel, 1986. "Finite automata play the repeated prisoner's dilemma," Journal of Economic Theory, Elsevier, vol. 39(1), pages 83-96, June.
When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:6:y:1994:i:3:p:370-399. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.