One - Memory in Repeated Games
Author
Abstract
Suggested Citation
Download full text from publisher
References listed on IDEAS
- Bhaskar, V. & Vega-Redondo, Fernando, 2002. "Asynchronous Choice and Markov Equilibria," Journal of Economic Theory, Elsevier, vol. 103(2), pages 334-350, April.
- Aumann, Robert J. & Sorin, Sylvain, 1989. "Cooperation and bounded recall," Games and Economic Behavior, Elsevier, vol. 1(1), pages 5-39, March.
- Abreu, Dilip, 1988. "On the Theory of Infinitely Repeated Games with Discounting," Econometrica, Econometric Society, vol. 56(2), pages 383-396, March.
- Kalai, Ehud & Stanford, William, 1988.
"Finite Rationality and Interpersonal Complexity in Repeated Games,"
Econometrica,
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.
- Mailath, George J. & Postlewaite, Andrew & Samuelson, Larry, 2005.
"Contemporaneous perfect epsilon-equilibria,"
Games and Economic Behavior,
Elsevier, vol. 53(1), pages 126-140, October.
- Mailath,G.J. & Postlewaite,A. & Samuelson,L., 2002. "Contemporaneous perfect Epsilon-equilibria," Working papers 5, Wisconsin Madison - Social Systems.
- George Mailath & Andrew Postlewaite & Larry Samuelson, 2003. "Contemporaneous Perfect Epsilon-Equilibria," PIER Working Paper Archive 03-021, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
- Mehmet Barlo & Guilherme Carmona, 2004.
"Time Dependent Bounded Recall Strategies Are Enough to Play the Discounted Repeated Prisoners' Dilemma,"
Game Theory and Information
0405006, EconWPA.
- Barlo, Mehmet & Carmona, Guilherme, 2004. "Time Dependent Bounded Recall Strategies Are Enough to Play the Discounted Repeated Prisoners Dilemma," FEUNL Working Paper Series wp449, Universidade Nova de Lisboa, Faculdade de Economia.
- Fudenberg, Drew & Maskin, Eric, 1986. "The Folk Theorem in Repeated Games with Discounting or with Incomplete Information," Econometrica, Econometric Society, vol. 54(3), pages 533-554, May.
- Abreu, Dilip & Dutta, Prajit K & Smith, Lones, 1994. "The Folk Theorem for Repeated Games: A NEU Condition," Econometrica, Econometric Society, vol. 62(4), pages 939-948, July.
- Neyman, Abraham & Okada, Daijiro, 1999. "Strategic Entropy and Complexity in Repeated Games," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 191-223, October.
- Lehrer, Ehud, 1988. "Repeated games with stationary bounded recall strategies," Journal of Economic Theory, Elsevier, vol. 46(1), pages 130-144, October.
More about this item
NEP fields
This paper has been announced in the following NEP Reports:- NEP-ALL-2007-03-10 (All new papers)
- NEP-GTH-2007-03-10 (Game Theory)
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:unl:unlfep:wp500. 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: (Sean Story). General contact details of provider: http://edirc.repec.org/data/feunlpt.html .
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 CitEc recognized a reference but did not link an item in RePEc 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 RePEc Author Service 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.