Learning with bounded memory
AbstractThe paper studies infinite repetition of finite strategic form games. Players use a learning behavior and face bounds on their cognitive capacities. We show that for any given beliefprobability over the set of possible outcomes where players have no experience. games can be payoff classified and there always exists a stationary state in the space of action profiles. In particular, if the belief-probability assumes all possible outcomes without experience to be equally likely, in one class of Prisoners' Dilemmas where the average defecting payoff is higher than the cooperative payoff and the average cooperative payoff is lower than the defecting payoff, play converges in the long run to the static Nash equilibrium while in the other class of Prisoners' Dilemmas where the reserve holds, play converges to cooperation. Results are applied to a large class of 2 x 2 games.
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.
Bibliographic InfoPaper provided by Universidad Carlos III de Madrid in its series Open Access publications from Universidad Carlos III de Madrid with number info:hdl:10016/7224.
Date of creation:
Date of revision:
Contact details of provider:
Web page: http://www.uc3m.es
Cognitive complexity; Bounded logistic quantal response learning; Long run outcomes;
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.:
- Binmore, Kenneth G. & Samuelson, Larry, 1992. "Evolutionary stability in repeated games played by finite automata," Journal of Economic Theory, Elsevier, vol. 57(2), pages 278-305, August.
- CHEN, Hsiao-Ch. & FRIEDMAN, J.W. & THISSE, Jacques-Francois, 1996.
"Boundedly Rational Nash Equilibrium: A Probabilistic Choice Approach,"
CORE Discussion Papers
1996044, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Chen, Hsiao-Chi & Friedman, James W. & Thisse, Jacques-Francois, 1997. "Boundedly Rational Nash Equilibrium: A Probabilistic Choice Approach," Games and Economic Behavior, Elsevier, vol. 18(1), pages 32-54, January.
- Ehud Kalai & William Stanford, 1986.
"Finite Rationality and Interpersonal Complexity in Repeated Games,"
679, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Kalai, Ehud & Stanford, William, 1988. "Finite Rationality and Interpersonal Complexity in Repeated Games," Econometrica, Econometric Society, vol. 56(2), pages 397-410, March.
- 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.
- Bendor, J. & Mookherjee, D. & Ray, D., 1994.
"Aspirations, adaptive learning and cooperation in repeated games,"
1994-42, Tilburg University, Center for Economic Research.
- Bendor, J. & Mookherjee, D. & Ray, D., 1994. "Aspirations, Adaptive Learning and Cooperation in Reapeted Games," Papers 27, Boston University - Department of Economics.
- Sonsino, Doron, 1997. "Learning to Learn, Pattern Recognition, and Nash Equilibrium," Games and Economic Behavior, Elsevier, vol. 18(2), pages 286-331, February.
- Barry Sopher & Dilip Mookherjee, 1997.
"Learning and Decision Costs in Experimental Constant Sum Games,"
Departmental Working Papers
199527, Rutgers University, Department of Economics.
- Mookherjee, Dilip & Sopher, Barry, 1997. "Learning and Decision Costs in Experimental Constant Sum Games," Games and Economic Behavior, Elsevier, vol. 19(1), pages 97-132, April.
- Barry Sopher & Dilip Mookherjee, 2000. "Learning and Decision Costs in Experimental Constant Sum Games," Departmental Working Papers 199625, Rutgers University, Department of Economics.
- Rabin, Matthew, 1993.
"Incorporating Fairness into Game Theory and Economics,"
American Economic Review,
American Economic Association, vol. 83(5), pages 1281-1302, December.
- Matthew Rabin., 1992. "Incorporating Fairness into Game Theory and Economics," Economics Working Papers 92-199, University of California at Berkeley.
- M. Rabin, 2001. "Incorporating Fairness into Game Theory and Economics," Levine's Working Paper Archive 511, David K. Levine.
- Colin F. Camerer, 1997. "Progress in Behavioral Game Theory," Journal of Economic Perspectives, American Economic Association, vol. 11(4), pages 167-188, Fall.
- Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Contact person).
If references are entirely missing, you can add them using this form.