Bounded computational capacity equilibrium

Penelope Hernandez () and Eilon Solan ()

Journal of Economic Theory, 2016, vol. 163, issue C, 342-364

Abstract: A celebrated result of Abreu and Rubinstein (1988) states that in repeated games, when the players are restricted to playing strategies that can be implemented by finite automata and they have lexicographic preferences, the set of equilibrium payoffs is a strict subset of the set of feasible and individually rational payoffs. In this paper we explore the limitations of this result. We prove that if memory size is costly and players can use mixed automata, then a folk theorem obtains and the set of equilibrium payoffs is once again the set of feasible and individually rational payoffs. Our result emphasizes the role of memory cost and of mixing when players have bounded computational power.

Keywords: Bounded rationality; Automata; Complexity; Infinitely repeated games; Equilibrium (search for similar items in EconPapers)
JEL-codes: C72 C73 (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0022053116000284
Full text for ScienceDirect subscribers only

Related works:
Working Paper: Bounded Computational Capacity Equilibrium (2014)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:jetheo:v:163:y:2016:i:c:p:342-364

DOI: 10.1016/j.jet.2016.02.007

Access Statistics for this article

Journal of Economic Theory is currently edited by A. Lizzeri and K. Shell

More articles in Journal of Economic Theory from Elsevier
Bibliographic data for series maintained by Catherine Liu ().