Playing off-line games with bounded rationality
We study a two-person zero-sum game where players simultaneously choose sequences of actions, and the overall payoff is the average of a one-shot payoff over the joint sequence. We consider the maxmin value of the game played in pure strategies by boundedly rational players and model bounded rationality by introducing complexity limitations. First we define the complexity of a sequence by its smallest period (a nonperiodic sequence being of infinite complexity) and study the maxmin of the game where player 1 is restricted to strategies with complexity at most n and player 2 is restricted to strategies with complexity at most m. We study the asymptotics of this value and a complete characterization in the matching pennies case. We extend the analysis of matching pennies to strategies with bounded recall.
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.:
- Ben-porath, Elchanan, 1990. "The complexity of computing a best response automaton in repeated games with mixed strategies," Games and Economic Behavior, Elsevier, vol. 2(1), pages 1-12, March.
- Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
- Lehrer Ehud, 1994. "Finitely Many Players with Bounded Recall in Infinitely Repeated Games," Games and Economic Behavior, Elsevier, vol. 7(3), pages 390-405, November.
- Liaw, Sy-Sang & Liu, Ching, 2005. "The quasi-periodic time sequence of the population in minority game," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 351(2), pages 571-579.
- O'Connell, Thomas C. & Stearns, Richard E., 2003. "On finite strategy sets for finitely repeated zero-sum games," Games and Economic Behavior, Elsevier, vol. 43(1), pages 107-136, April.
- 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.
- Harold L. Cole & Narayana R. Kocherlakota, 2001.
"Finite memory and imperfect monitoring,"
287, Federal Reserve Bank of Minneapolis.
- 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," LSE Research Online Documents on Economics 2061, London School of Economics and Political Science, LSE Library.
- 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.
- repec:dau:papers:123456789/6381 is not listed on IDEAS
- Abreu, Dilip & Rubinstein, Ariel, 1988. "The Structure of Nash Equilibrium in Repeated Games with Finite Automata," Econometrica, Econometric Society, vol. 56(6), pages 1259-1281, November.
- Olivier Gossner & Penelope Hernandez, 2006.
"Coordination through De Bruijn sequences,"
- 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.
- Abraham Neyman & Daijiro Okada, 2000. "Two-person repeated games with finite automata," International Journal of Game Theory, Springer;Game Theory Society, vol. 29(3), pages 309-325.
- Neyman, Abraham & Okada, Daijiro, 2000. "Repeated Games with Bounded Entropy," Games and Economic Behavior, Elsevier, vol. 30(2), pages 228-247, February.
- Ben-Porath Elchanan, 1993.
"Repeated Games with Finite Automata,"
Journal of Economic Theory,
Elsevier, vol. 59(1), pages 17-32, February.
- Lehrer, Ehud, 1988. "Repeated games with stationary bounded recall strategies," Journal of Economic Theory, Elsevier, vol. 46(1), pages 130-144, October.
- Rubinstein, Ariel, 1986.
"Finite automata play the repeated prisoner's dilemma,"
Journal of Economic Theory,
Elsevier, vol. 39(1), pages 83-96, June.
- Ariel Rubinstein, 1997. "Finite automata play the repeated prisioners dilemma," Levine's Working Paper Archive 1639, David K. Levine.
- Olivier Gossner & Penelope Hernandez & Abraham Neyman, 2003. "Online Matching Pennies," Discussion Paper Series dp316, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Sabourian, Hamid, 1998. "Repeated games with M-period bounded memory (pure strategies)," Journal of Mathematical Economics, Elsevier, vol. 30(1), pages 1-35, August.
- GOSSNER, Olivier & HERNANDEZ, Pénélope, 2001.
"On the complexity of coordination,"
CORE Discussion Papers
2001047, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Gilad Bavly & Abraham Neyman, 2003. "Online Concealed Correlation by Boundedly Rational Players," Discussion Paper Series dp336, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
When requesting a correction, please mention this item's handle: RePEc:eee:matsoc:v:56:y:2008:i:2:p:207-223. 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: (Dana Niculescu)
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.