On the complexity of rationalizing behavior
AbstractWe 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 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 Department of Economics and Business, Universitat Pompeu Fabra in its series Economics Working Papers with number 1048.
Date of creation: Sep 2007
Date of revision:
Contact details of provider:
Web page: http://www.econ.upf.edu/
Rationalization; Computational complexity; NP-complete; Arbitrary Choice Domains;
Other versions of this item:
- D00 - Microeconomics - - General - - - General
This paper has been announced in the following NEP Reports:
- NEP-ALL-2007-09-30 (All new papers)
- NEP-DCM-2007-09-30 (Discrete Choice Models)
- NEP-HPE-2007-09-30 (History & Philosophy of Economics)
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.:
- Yuval Salant, 2003. "Limited Computational Resources Favor Rationality," NajEcon Working Paper Reviews 666156000000000082, www.najecon.org.
- Enriqueta Aragones & Itzhak Gilboa & Andrew Postlewaite & David Schmeidler, 2003.
PIER Working Paper Archive
05-002, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 01 Dec 2004.
- Enriqueta Aragones & Itzhak Gilboa & Andrew Postlewaite & David Schmeidler, 2004. "Fact-Free Learning," Cowles Foundation Discussion Papers 1491, Cowles Foundation for Research in Economics, Yale University.
- 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.
- Paola Manzini & Marco Mariotti, 2007. "Sequentially Rationalizable Choice," American Economic Review, American Economic Association, vol. 97(5), pages 1824-1839, December.
- Xu, Yongsheng & Zhou, Lin, 2007. "Rationalizability of choice functions by game trees," Journal of Economic Theory, Elsevier, vol. 134(1), pages 548-556, May.
- Gil Kalai & Ariel Rubinstein & Ran Spiegler, 2001.
"Rationalizing Choice Functions by Multiple Rationales,"
Discussion Paper Series
dp278, The Center for the Study of Rationality, Hebrew University, Jerusalem.
- Gil Kalai & Ariel Rubinstein & Ran Spiegler, 2002. "Rationalizing Choice Functions By Multiple Rationales," Econometrica, Econometric Society, vol. 70(6), pages 2481-2488, November.
- Gil Kalai & Ariel Rubenstein & Ran Spiegler, 2001. "Rationalizing Choice Functions by Multiple Rationales," Economics Working Papers 0010, Institute for Advanced Study, School of Social Science.
- Yuval Salant, 2003. "Limited Computational Resources Favor Rationality," Discussion Paper Series dp320, The Center for the Study of Rationality, Hebrew University, Jerusalem.
- Ballester, Coralio, 2004. "NP-completeness in hedonic games," Games and Economic Behavior, Elsevier, vol. 49(1), pages 1-30, October.
- Sen, Amartya K, 1971. "Choice Functions and Revealed Preference," Review of Economic Studies, Wiley Blackwell, vol. 38(115), pages 307-17, July.
- Tyson, Christopher J., 2008.
"Cognitive constraints, contraction consistency, and the satisficing criterion,"
Journal of Economic Theory,
Elsevier, vol. 138(1), pages 51-70, January.
- Tyson, Chris, 2001. "The Foundations of Imperfect Decision Making," Research Papers 1714, Stanford University, Graduate School of Business.
- Christopher J.Tyson, 2005. "Axiomatic Foundations for Satisficing Behavior," Economics Papers 2005-W03, Economics Group, Nuffield College, University of Oxford.
- Christopher J. Tyson, 2007. "Cognitive Constraints, Contraction Consistency, and the Satisficing Criterion," Working Papers 614, Queen Mary, University of London, School of Economics and Finance.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ().
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.