The computational complexity of boundedly rational choice behavior
This research examines the computational complexity of two boundedly rational choice models that use multiple rationales to explain observed choice behavior. First, we show that the notion of rationalizability by K rationales as introduced by Kalai, Rubinstein, and Spiegler (2002) is NP-complete for K greater or equal to two. Second, we show that the question of sequential rationalizability by K rationales, introduced by Manzini and Mariotti (2007), is NP-complete for K greater or equal to three if choices are single valued, and that it is NP-complete for K greater or equal to one if we allow for multi-valued choice correspondences. Motivated by these results, we present two binary integer feasibility programs that characterize the two boundedly rational choice models and we compute their power. Finally, by using results from descriptive complexity theory, we explain why it has been so difficult to obtain `nice' characterizations for these models.
Year of publication: |
2010-07
|
---|---|
Authors: | DEMUYNCK, Thomas |
Institutions: | Centrum voor Economische Studiƫn, Faculteit Economie en Bedrijfswetenschappen |
Saved in:
freely available
Saved in favorites
Similar items by person
-
Degrees of cooperation in household consumption models: a revealed preference analysis
CHERCHYE, Laurens, (2009)
-
Nash bargained consumption decisions: a revealed preference analysis
CHERCHYE, Laurens, (2011)
-
The empirical content of Cournot competition
CHERCHYE, Laurens, (2011)
- More ...