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 Barcelona Graduate School of Economics in its series Working Papers with number 320.
Date of creation: Aug 2007
Date of revision:
Rationalization; Computational complexity; NP-complete; Arbitrary choice domains.;
Other versions of this item:
- D00 - Microeconomics - - General - - - General
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.:
- Sen, Amartya K, 1971. "Choice Functions and Revealed Preference," Review of Economic Studies, Wiley Blackwell, vol. 38(115), pages 307-17, July.
- Enriqueta Aragones & Itzhak Gilboa & Andrew Postlewaite & David Schmeidler, 2003.
PIER Working Paper Archive
03-023, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
- 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.
- 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.
- Ballester, Coralio, 2004. "NP-completeness in hedonic games," Games and Economic Behavior, Elsevier, vol. 49(1), pages 1-30, October.
- Yuval Salant, 2003. "Limited Computational Resources Favor Rationality," Discussion Paper Series dp320, The Center for the Study of Rationality, Hebrew University, Jerusalem.
- 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.
- 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 Rubinstein & Ran Spiegler, 2001. "Rationalizing Choice Functions by Multiple Rationales," Discussion Paper Series dp278, The Center for the Study of Rationality, Hebrew University, Jerusalem.
- Xu, Yongsheng & Zhou, Lin, 2007. "Rationalizability of choice functions by game trees," Journal of Economic Theory, Elsevier, vol. 134(1), pages 548-556, May.
- Paola Manzini & Marco Mariotti, 2007. "Sequentially Rationalizable Choice," American Economic Review, American Economic Association, vol. 97(5), pages 1824-1839, December.
- Yuval Salant, 2003. "Limited Computational Resources Favor Rationality," NajEcon Working Paper Reviews 666156000000000082, www.najecon.org.
- S. Illeris & G. Akehurst, 2001. "Introduction," The Service Industries Journal, Taylor and Francis Journals, vol. 21(1), pages 1-4, January.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Bruno Guallar).
If references are entirely missing, you can add them using this form.