On The Complexity of Rationalizing Behavior
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.
|Date of creation:||Aug 2007|
|Contact details of provider:|| Postal: Ramon Trias Fargas, 25-27, 08005 Barcelona|
Phone: +34 93 542-1222
Fax: +34 93 542-1223
Web page: http://www.barcelonagse.eu
More information through EDIRC
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.:
- Gil Kalai & Ariel Rubinstein & Ran Spiegler, 2001.
"Rationalizing Choice Functions by Multiple Rationales,"
Discussion Paper Series
dp278, The Federmann Center for the Study of Rationality, the 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.
- 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.
- Itzhak Gilboa & Enriqueta Aragones & Andrew Postlewaite & David Schmeidler, 2005. "Fact-Free Learning," Post-Print hal-00481243, HAL.
- 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.
- Yuval Salant, 2003. "Limited Computational Resources Favor Rationality," Discussion Paper Series dp320, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Amartya K. Sen, 1971. "Choice Functions and Revealed Preference," Review of Economic Studies, Oxford University Press, vol. 38(3), pages 307-317.
- S. Illeris & G. Akehurst, 2001. "Introduction," The Service Industries Journal, Taylor & Francis Journals, vol. 21(1), pages 1-4, January.
- Ariel Rubinstein, 2000.
"Economics and Language,"
Online economics textbooks,
SUNY-Oswego, Department of Economics, number lang1.
- A. Rubinstein, 1999. "Economics and Language," Princeton Economic Theory Papers 00s6, Economics Department, Princeton University.
- Rubinstein, A., 1998. "Economics and Language," Papers 14-98, Tel Aviv.
- Ariel Rubinstein, 2005. "Economics and Language," Levine's Bibliography 666156000000000654, UCLA Department of Economics.
- 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.
- Ballester, Coralio, 2004. "NP-completeness in hedonic games," Games and Economic Behavior, Elsevier, vol. 49(1), pages 1-30, October.
- Xu, Yongsheng & Zhou, Lin, 2007. "Rationalizability of choice functions by game trees," Journal of Economic Theory, Elsevier, vol. 134(1), pages 548-556, May.
When requesting a correction, please mention this item's handle: RePEc:bge:wpaper:320. 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: (Bruno Guallar)
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.