An Approach to Bounded Rationality
AbstractA central question in game theory and artificial intelligence is how a rational agent should behave in a complex environment, given that it cannot perform unbounded computations. We study strategic aspects of this question by formulating a simple model of a game with additional costs (computational or otherwise) for each strategy. First we connect this to zero-sum games, proving a counter-intuitive generalization of the classic min-max theorem to zero-sum games with the addition of strategy costs. We then show that potential games with strategy costs remain potential games. Both zero-sum and potential games with strategy costs maintain a very appealing property: simple learning dynamics converge to equilibrium.
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 Northwestern University, Center for Mathematical Studies in Economics and Management Science in its series Discussion Papers with number 1439.
Date of creation: Nov 2006
Date of revision:
Contact details of provider:
Postal: Center for Mathematical Studies in Economics and Management Science, Northwestern University, 580 Jacobs Center, 2001 Sheridan Road, Evanston, IL 60208-2014
Web page: http://www.kellogg.northwestern.edu/research/math/
More information through EDIRC
This paper has been announced in the following NEP Reports:
- NEP-ALL-2007-04-09 (All new papers)
- NEP-CBE-2007-04-09 (Cognitive & Behavioural Economics)
- NEP-EVO-2007-04-09 (Evolutionary Economics)
- NEP-GTH-2007-04-09 (Game Theory)
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.:
- Hart, Sergiu & Mas-Colell, Andreu, 2001.
"A General Class of Adaptive Strategies,"
Journal of Economic Theory,
Elsevier, vol. 98(1), pages 26-54, May.
- Sergiu Hart & Andreu Mas-Colell, 1999. "A General Class of Adaptive Strategies," Game Theory and Information 9904001, EconWPA, revised 23 Mar 2000.
- Sergiu Hart & Andreu Mas-Colell, 1999. "A general class of adaptative strategies," Economics Working Papers 373, Department of Economics and Business, Universitat Pompeu Fabra.
- Ben-Porath Elchanan, 1993. "Repeated Games with Finite Automata," Journal of Economic Theory, Elsevier, vol. 59(1), pages 17-32, February.
- Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
- Ariel Rubinstein, 1997.
"Finite automata play the repeated prisioners dilemma,"
Levine's Working Paper Archive
1639, David K. Levine.
- Rubinstein, Ariel, 1986. "Finite automata play the repeated prisoner's dilemma," Journal of Economic Theory, Elsevier, vol. 39(1), pages 83-96, June.
- Ewerhart, Christian, 2000.
"Chess-like Games Are Dominance Solvable in at Most Two Steps,"
Games and Economic Behavior,
Elsevier, vol. 33(1), pages 41-47, October.
- Ewerhart, Christian, 2000. "Chess-like games are dominancesolvable in at most two steps," Sonderforschungsbereich 504 Publications 00-24, Sonderforschungsbereich 504, Universität Mannheim & Sonderforschungsbereich 504, University of Mannheim.
- Foster, Dean P. & Vohra, Rakesh, 1999. "Regret in the On-Line Decision Problem," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 7-35, October.
- Abreu, Dilip & Rubinstein, Ariel, 1988. "The Structure of Nash Equilibrium in Repeated Games with Finite Automata," Econometrica, Econometric Society, vol. 56(6), pages 1259-81, November.
- Ehud Kalai, 1987. "Bounded Rationality and Strategic Complexity in Repeated Games," Discussion Papers 783, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Herbert A. Simon, 1996. "The Sciences of the Artificial, 3rd Edition," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262691914, January.
- Waters, George A., 2009. "Chaos in the cobweb model with a new learning dynamic," Journal of Economic Dynamics and Control, Elsevier, vol. 33(6), pages 1201-1216, June.
- Jiang, Albert Xin & Leyton-Brown, Kevin & Bhat, Navin A.R., 2011. "Action-Graph Games," Games and Economic Behavior, Elsevier, vol. 71(1), pages 141-173, January.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Fran Walker).
If references are entirely missing, you can add them using this form.