Limited Computational Resources Favor Rationality
AbstractA choice function is a rule that chooses a single alternative from every set of alternatives drawn from a finite ground set. A rationalizable choice function satisfies the consistency condition; i.e., if an alternative is chosen from a set A, then the same alternative is also chosen from every subset of A that contains it. In this paper we study computational aspects of choice, through choice functions. We explore two simple models that demonstrate two important aspects of choice procedures: the ability to remember the past and the ability to perform complex computations. We show that a choice function is optimal in terms of the amount of memory and the computational power required for its computation if and only if the function is rationalizable. We also show that the computation of most other choice functions, including some “natural” ones, requires much more memory and computational power.
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 The Center for the Study of Rationality, Hebrew University, Jerusalem in its series Discussion Paper Series with number dp320.
Length: 32 pages
Date of creation: Jul 2003
Date of revision:
This paper has been announced in the following NEP Reports:
- NEP-CBE-2003-07-10 (Cognitive & Behavioural Economics)
- NEP-CMP-2003-07-10 (Computational Economics)
- NEP-DCM-2003-07-10 (Discrete Choice Models)
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.:
- 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, 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, 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.
- 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.
- Martin J Osborne & Ariel Rubinstein, 2009.
"A Course in Game Theory,"
814577000000000225, UCLA Department of Economics.
- Jose Apesteguia & Miguel A Ballester, 2007.
"On The Complexity of Rationalizing Behavior,"
320, Barcelona Graduate School of Economics.
- Apesteguia, Jose & Ballester, Miguel A., 2010. "The Computational Complexity of Rationalizing Behavior," Journal of Mathematical Economics, Elsevier, vol. 46(3), pages 356-363, May.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ilan Nehama).
If references are entirely missing, you can add them using this form.