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.
|Date of creation:||Jul 2010|
|Date of revision:|
|Contact details of provider:|| Postal: |
Phone: +32-(0)16-32 67 25
Fax: +32-(0)16-32 67 96
Web page: http://www.econ.kuleuven.be/ew
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:ete:ceswps:ces10.23. See general information about how to correct material in RePEc.
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.