The computational complexity of boundedly rational choice behavior

Thomas Demuynck

Working Papers of Department of Economics, Leuven from KU Leuven, Faculty of Economics and Business (FEB), Department of Economics, Leuven

Abstract: 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.

Date: 2010-07
New Economics Papers: this item is included in nep-cbe, nep-cmp, nep-evo and nep-upt
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://lirias.kuleuven.be/bitstream/123456789/274778/1/DPS1023.pdf

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ete:ceswps:ces10.23

Access Statistics for this paper

More papers in Working Papers of Department of Economics, Leuven from KU Leuven, Faculty of Economics and Business (FEB), Department of Economics, Leuven
Bibliographic data for series maintained by library EBIB ().