The computational complexity of rationalizing boundedly rational choice behavior
Thomas Demuynck
Journal of Mathematical Economics, 2011, vol. 47, issue 4-5, 425-433
Abstract:
We determine the computational complexity of various choice models that use multiple rationales to explain observed choice behavior. First, we demonstrate that the notion of rationalizability by K rationales, introduced by Kalai et al. (2002), is NP-complete for K greater than or equal to two. Then, we show that the question of sequential rationalizability by K rationales, introduced by Manzini and Mariotti (2007), is NP-complete for K greater than or equal to three. Finally, we focus on the computational complexity of two models that refine this model of sequential choice behavior. We establish that the model of choice by game trees, from Xu and Zhou (2007), is NP-complete while the status-quo bias model, from Masatlioglu and Ok (2005), can be verified in polynomial time.
Keywords: Boundedly rational choice; Rationalization by multiple rationales; Sequential rationalization; Rationalization by game trees; Status-quo bias; Computational complexity; NP-completeness (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0304406811000504
Full text for ScienceDirect subscribers only
Related works:
Working Paper: The computational complexity of rationalizing boundedly rational choice behavior (2011) 
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:eee:mateco:v:47:y:2011:i:4:p:425-433
DOI: 10.1016/j.jmateco.2011.05.001
Access Statistics for this article
Journal of Mathematical Economics is currently edited by Atsushi (A.) Kajii
More articles in Journal of Mathematical Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().