The Computational Complexity of Rationalizing Behavior
AbstractWe study the computational 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 a collection of complete preorders that rationalizes behavior turns out to be intractable. We also 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Journal of Mathematical Economics.
Volume (Year): 46 (2010)
Issue (Month): 3 (May)
Contact details of provider:
Web page: http://www.elsevier.com/locate/jmateco
Rationalization Computational complexity NP-complete Arbitrary choice domains;
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.:
- Johnson, Mark R. & Dean, Richard A., 2001. "Locally complete path independent choice functions and their lattices," Mathematical Social Sciences, Elsevier, vol. 42(1), pages 53-87, July.
- Jose Apesteguia & Miguel A. Ballester, 2012.
"Choice by sequential procedures,"
Economics Working Papers
1309, Department of Economics and Business, Universitat Pompeu Fabra.
- Rubinstein,Ariel, 2000.
"Economics and Language,"
Cambridge University Press, number 9780521789905, October.
- A. Rubinstein, 1999. "Economics and Language," Princeton Economic Theory Papers 00s6, Economics Department, Princeton University.
- Ariel Rubinstein, 2005. "Economics and Language," Levine's Bibliography 666156000000000654, UCLA Department of Economics.
- Rubinstein, A., 1998. "Economics and Language," Papers 14-98, Tel Aviv.
- Paola Manzini & Marco Mariotti, 2007. "Sequentially Rationalizable Choice," American Economic Review, American Economic Association, vol. 97(5), pages 1824-1839, December.
- Futia, Carl, 1977. "The complexity of economic decision rules," Journal of Mathematical Economics, Elsevier, vol. 4(3), pages 289-299, December.
- Enriqueta Aragones & Itzhak Gilboa & Andrew Postlewaite & David Schmeidler, 2004.
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 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, 2003. "Fact-Free Learning," PIER Working Paper Archive 03-023, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
- Mandler, Michael & Manzini, Paola & Mariotti, Marco, 2008.
"A Million Answers to Twenty Questions: Choosing by Checklist,"
IZA Discussion Papers
3377, Institute for the Study of Labor (IZA).
- Mandler, Michael & Manzini, Paola & Mariotti, Marco, 2012. "A million answers to twenty questions: Choosing by checklist," Journal of Economic Theory, Elsevier, vol. 147(1), pages 71-92.
- Michael Mandler & Paola Manzini & Marco Mariotti, 2008. "A Million Answers to Twenty Questions: Choosing by Checklist," Working Papers 622, Queen Mary, University of London, School of Economics and Finance.
- 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.
- Amos Tversky & Itamar Simonson, 1993. "Context-Dependent Preferences," Management Science, INFORMS, vol. 39(10), pages 1179-1189, October.
- Yuval Salant, 2003. "Limited Computational Resources Favor Rationality," NajEcon Working Paper Reviews 666156000000000082, www.najecon.org.
- Yuval Salant, 2003. "Limited Computational Resources Favor Rationality," Discussion Paper Series dp320, The Center for the Study of Rationality, Hebrew University, Jerusalem.
- Johnson, Mark R., 1990. "Information, associativity, and choice requirements," Journal of Economic Theory, Elsevier, vol. 52(2), pages 440-452, December.
- S. Illeris & G. Akehurst, 2001. "Introduction," The Service Industries Journal, Taylor & Francis Journals, vol. 21(1), pages 1-4, January.
- Koshevoy, Gleb A., 1999. "Choice functions and abstract convex geometries," Mathematical Social Sciences, Elsevier, vol. 38(1), pages 35-44, July.
- Campbell, Donald E, 1978. "Realization of Choice Functions," Econometrica, Econometric Society, vol. 46(1), pages 171-80, January.
- Ballester, Coralio, 2004. "NP-completeness in hedonic games," Games and Economic Behavior, Elsevier, vol. 49(1), pages 1-30, October.
- Thomas Demuynck, 2014.
"The computational complexity of rationalizing Pareto optimal choice behavior,"
Social Choice and Welfare,
Springer, vol. 42(3), pages 529-549, March.
- Thomas DEMUYNCK, 2011. "The computational complexity of rationalizing Pareto optimal choice behavior," Center for Economic Studies - Discussion papers ces11.13, Katholieke Universiteit Leuven, Centrum voor Economische Studiën.
- Demuynck, Thomas, 2011. "The computational complexity of rationalizing boundedly rational choice behavior," Journal of Mathematical Economics, Elsevier, vol. 47(4-5), pages 425-433.
- Ronen Gradwohl & Eran Shmaya, 2013. "Tractable Falsifiability," Discussion Papers 1564, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
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.