Repeated games with M-period bounded memory (pure strategies)
AbstractNo abstract is available for this item.
Download InfoIf 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.
Bibliographic InfoArticle provided by Elsevier in its journal Journal of Mathematical Economics.
Volume (Year): 30 (1998)
Issue (Month): 1 (August)
Contact details of provider:
Web page: http://www.elsevier.com/locate/jmateco
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.:
- Rubinstein, Ariel, 1979. "Equilibrium in supergames with the overtaking criterion," Journal of Economic Theory, Elsevier, vol. 21(1), pages 1-9, August.
- 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-54, May.
- George J. Mailath & Wojciech Olszewski, 2008.
"Folk Theorems with Bounded Recall under (Almost) Perfect Monitoring,"
PIER Working Paper Archive
08-019, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
- Mailath, George J. & Olszewski, Wojciech, 2011. "Folk theorems with bounded recall under (almost) perfect monitoring," Games and Economic Behavior, Elsevier, vol. 71(1), pages 174-192, January.
- George Mailath & Wojciech Olszewski, 2008. "Folk theorems with Bounded Recall under(Almost) Perfect Monitoring," Discussion Papers 1462, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Michele Piccione & Ariel Rubinstein, 2003.
"Modeling the Economic Interaction of Agents With Diverse Abilities to Recognize Equilibrium Patterns,"
Journal of the European Economic Association,
MIT Press, vol. 1(1), pages 212-223, 03.
- Michele Piccione & Ariel Rubinstein, 2010. "Modeling the Economic Interaction of Agents with Diverse Abilities to Recognize Equilibrium Patterns," Levine's Working Paper Archive 506439000000000108, David K. Levine.
- Michele Piccione & Ariel Rubinstein, 2002. "Modelling the Economic Interaction of Agents with Diverse Abilities to Recognise Equilibrium Patterns," STICERD - Theoretical Economics Paper Series 440, Suntory and Toyota International Centres for Economics and Related Disciplines, LSE.
- Julian Romero, 2011. "Finite Automata in Undiscounted Repeated Games with Private Monitoring," Purdue University Economics Working Papers 1260, Purdue University, Department of Economics.
- Huck Steffen & Sarin Rajiv, 2004.
"Players With Limited Memory,"
The B.E. Journal of Theoretical Economics,
De Gruyter, vol. 4(1), pages 1-27, September.
- Steffen Huck & Rajiv Sarin, 2000. "Players with Limited Memory," Econometric Society World Congress 2000 Contributed Papers 1645, Econometric Society.
- Harold L. Cole & Narayana R. Kocherlakota, 2000.
"Finite memory and imperfect monitoring,"
604, Federal Reserve Bank of Minneapolis.
- Barlo, Mehmet & Carmona, Guilherme & Sabourian, Hamid, 2009. "Repeated games with one-memory," Journal of Economic Theory, Elsevier, vol. 144(1), pages 312-336, January.
- Luca Anderlini & Dino Gerardi & Roger Lagunoff, 2004.
"The Folk Theorem in Dynastic Repeated Games,"
122247000000000577, UCLA Department of Economics.
- Luca Anderlini & Dino Gerardi & Roger Lagunoff, 2004. "The Folk Theorem in Dynastic Repeated Games," Cowles Foundation Discussion Papers 1490, Cowles Foundation for Research in Economics, Yale University.
- Luca Anderlini (Georgetown University), Dino Gerardi (Yale University), Roger Lagunoff (Georgetown University), 2004. "The Folk Theorem in Dynastic Repeated Games," Working Papers gueconwpa~04-04-09, Georgetown University, Department of Economics.
- Luca Anderlini & Dino Gerardi & Roger Lagunoff, 2004. "The Folk Theorem in Dynastic Repeated Games," Game Theory and Information 0410001, EconWPA.
- V. Bhaskar & Fernando Vega-Redondo, 1998. "Asynchronous Choice and Markov Equilibria:Theoretical Foundations and Applications," Game Theory and Information 9809003, EconWPA.
- Scarsini, Marco & Renault, Jérôme & Tomala, Tristan, 2008.
"Playing off-line games with bounded rationality,"
Economics Papers from University Paris Dauphine
123456789/6127, Paris Dauphine University.
- Breitmoser, Yves, 2012. "Cooperation, but no reciprocity: Individual strategies in the repeated Prisoner's Dilemma," MPRA Paper 41731, University Library of Munich, Germany.
- Barlo, Mehmet & Urgun, Can, 2011. "Stochastic discounting in repeated games: Awaiting the almost inevitable," MPRA Paper 28537, University Library of Munich, Germany.
- Renault, Jérôme & Scarsini, Marco & Tomala, Tristan, 2007. "A minority game with bounded recall," Economics Papers from University Paris Dauphine 123456789/6381, Paris Dauphine University.
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.