This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

On the Complexity of Rationalizing Behavior

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Jose Apesteguia ()
Miguel A. Ballester

Additional information is available for the following registered author(s):

Abstract

We study the complexity of rationalizing choice behavior. We do so by analyzing two polar cases, and a number of intermediate ones. In our most structured case, that is where choice behavior is defined in universal choice domains and satisfies the "weak axiom of revealed preference," finding the complete preorder rationalizing choice behavior is a simple matter. In the polar case, where no restriction whatsoever is imposed, either on choice behavior or on choice domain, finding the complete preorders that rationalize behavior turns out to be intractable. We show that the task of finding the rationalizing complete preorders is equivalent to a graph problem. This allows the search for existing algorithms in the graph theory literature, for the rationalization of choice.

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. 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.upf.edu/docs/papers/downloads/1048.pdf
File Format: application/pdf
File Function: Whole Paper
Download Restriction: no

Publisher Info
Paper provided by Department of Economics and Business, Universitat Pompeu Fabra in its series Economics Working Papers with number 1048.

Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Length:
Date of creation: Sep 2007
Date of revision:
Handle: RePEc:upf:upfgen:1048

Contact details of provider:
Web page: http://www.econ.upf.edu/

For technical questions regarding this item, or to correct its listing, contact: ().

Related research
Keywords: Rationalization; Computational complexity; NP-complete; Arbitrary Choice Domains;

Find related papers by JEL classification:
D00 - Microeconomics - - General - - - General

This paper has been announced in the following NEP Reports:

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
  1. Yuval Salant, 2003. "Limited Computational Resources Favor Rationality," NajEcon Working Paper Reviews 666156000000000082, www.najecon.org. [Downloadable!]
  2. Yuval Salant, 2003. "Limited Computational Resources Favor Rationality," Discussion Paper Series dp320, Center for Rationality and Interactive Decision Theory, Hebrew University, Jerusalem. [Downloadable!]
  3. Paola Manzini & Marco Mariotti, 2007. "Sequentially Rationalizable Choice," American Economic Review, American Economic Association, vol. 97(5), pages 1824-1839, December. [Downloadable!]
  4. Gil Kalai & Ariel Rubinstein & Ran Spiegler, 2002. "Rationalizing Choice Functions By Multiple Rationales," Econometrica, Econometric Society, vol. 70(6), pages 2481-2488, November. [Downloadable!] (restricted)
    Other versions:
  5. Ballester, Coralio, 2004. "NP-completeness in hedonic games," Games and Economic Behavior, Elsevier, vol. 49(1), pages 1-30, October. [Downloadable!] (restricted)
  6. Sen, Amartya K, 1971. "Choice Functions and Revealed Preference," Review of Economic Studies, Blackwell Publishing, vol. 38(115), pages 307-17, July. [Downloadable!] (restricted)
  7. Enriqueta Aragones & Itzhak Gilboa & Andrew Postlewaite & David Schmeidler, 2005. "Fact-Free Learning," American Economic Review, American Economic Association, vol. 95(5), pages 1355-1368, December. [Downloadable!]
    Other versions:
    • Enriqueta Aragones & Itzhak Gilboa & Andrew Postlewaite & David Schmeidler, 2004. "Fact-Free Learning," Cowles Foundation Discussion Papers 1491, Cowles Foundation, Yale University. [Downloadable!]
    • Enriqueta Aragones & Itzhak Gilboa & Andrew Postlewaite & David Schmeidler, 2003. "Fact-Free Learning," PIER Working Paper Archive 05-002, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 01 Dec 2004. [Downloadable!]
    • Enriqueta Aragones & Itzhak Gilboa & Andrew Postlewaite & David Schmeidler, 2003. "Fact-Free Learning," PIER Working Paper Archive 03-023, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania. [Downloadable!]
  8. Xu, Yongsheng & Zhou, Lin, 2007. "Rationalizability of choice functions by game trees," Journal of Economic Theory, Elsevier, vol. 134(1), pages 548-556, May. [Downloadable!] (restricted)
Full references

Statistics
Access and download statistics

Did you know? Authors can create their own profile with links to their works on the RePEc Author Service.

This page was last updated on 2009-11-27.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.