Limited Computational Resources Favor Rationality
A 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.
Year of publication: |
2003-07
|
---|---|
Authors: | Salant, Yuval |
Institutions: | Center for the Study of Rationality, Hebrew University of Jerusalem |
Saved in:
freely available
Saved in favorites
Similar items by person
-
Learning the decisions of small committees
Salant, Yuval, (2003)
-
Two Comments on the Principle of Revealed Preference
Rubinstein, Ariel, (2006)
-
Procedural Analysis of Choice Rules with Applications to Bounded Rationality
Salant, Yuval, (2011)
- More ...