The computational complexity of boundedly rational choice behavior
AbstractThis 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.
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 Katholieke Universiteit Leuven, Centrum voor Economische Studiën in its series Center for Economic Studies - Discussion papers with number ces10.23.
Date of creation: Jul 2010
Date of revision:
This paper has been announced in the following NEP Reports:
- NEP-ALL-2010-12-23 (All new papers)
- NEP-CBE-2010-12-23 (Cognitive & Behavioural Economics)
- NEP-CMP-2010-12-23 (Computational Economics)
- NEP-EVO-2010-12-23 (Evolutionary Economics)
- NEP-UPT-2010-12-23 (Utility Models & Prospect Theory)
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Ronen Gradwohl & Eran Shmaya, 2013. "Tractable Falsifiability," Discussion Papers 1564, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Karla Vander Weyden).
If references are entirely missing, you can add them using this form.