Advanced Search
MyIDEAS: Login

The computational complexity of boundedly rational choice behavior

Contents:

Author Info

  • Thomas DEMUYNCK

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.

Download Info

If 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.
File URL: http://www.econ.kuleuven.be/eng/ew/discussionpapers/Dps10/Dps1023.pdf
Download Restriction: no

Bibliographic Info

Paper provided by Katholieke Universiteit Leuven, Centrum voor Economische Studiën in its series Center for Economic Studies - Discussion papers with number ces10.23.

as in new window
Length:
Date of creation: Jul 2010
Date of revision:
Handle: RePEc:ete:ceswps:ces10.23

Contact details of provider:
Postal: Naamsestraat 69, 3000 Leuven
Phone: +32-(0)16-32 67 25
Fax: +32-(0)16-32 67 96
Email:
Web page: http://www.econ.kuleuven.be/ew
More information through EDIRC

Related research

Keywords:

This paper has been announced in the following NEP Reports:

References

No references listed on IDEAS
You can help add them by filling out this form.

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Ronen Gradwohl & Eran Shmaya, 2013. "Tractable Falsifiability," Discussion Papers 1564, Northwestern University, Center for Mathematical Studies in Economics and Management Science.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

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 you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.