The Computational Complexity of Rationalizing Behavior
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Ariel Rubinstein, 2000.
"Economics and Language,"
Online economics textbooks,
SUNY-Oswego, Department of Economics, number lang1, March.
- Rubinstein,Ariel, 2000. "Economics and Language," Cambridge Books, Cambridge University Press, number 9780521593069, May.
- Rubinstein,Ariel, 2000. "Economics and Language," Cambridge Books, Cambridge University Press, number 9780521789905, May.
- 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.
- A. Rubinstein, 1999. "Economics and Language," Princeton Economic Theory Papers 00s6, Economics Department, Princeton University.
- Yuval Salant, 2003. "Limited Computational Resources Favor Rationality," NajEcon Working Paper Reviews 666156000000000082, www.najecon.org.
- 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.
- 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.
- 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 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.
- Apesteguia, Jose & Ballester, Miguel A., 2013.
"Choice by sequential procedures,"
Games and Economic Behavior,
Elsevier, vol. 77(1), pages 90-99.
- Jose Apesteguia & Miguel Ballester, 2009. "Choice by Sequential Procedures," NajEcon Working Paper Reviews 814577000000000404, www.najecon.org.
- Jose Apesteguia & Miguel Ángel Ballester, 2012. "Choice By Sequential Procedures," Working Papers 615, Barcelona Graduate School of Economics.
- Jose Apesteguia & Miguel A. Ballester, 2012. "Choice by sequential procedures," Economics Working Papers 1309, Department of Economics and Business, Universitat Pompeu Fabra.
- S. Illeris & G. Akehurst, 2001. "Introduction," The Service Industries Journal, Taylor & Francis Journals, vol. 21(1), pages 1-4, January.
- Campbell, Donald E, 1978. "Realization of Choice Functions," Econometrica, Econometric Society, vol. 46(1), pages 171-180, January.
- Paola Manzini & Marco Mariotti, 2007. "Sequentially Rationalizable Choice," American Economic Review, American Economic Association, vol. 97(5), pages 1824-1839, December.
- Johnson Mark R., 1995. "Ideal Structures of Path Independent Choice Functions," Journal of Economic Theory, Elsevier, vol. 65(2), pages 468-504, April.
- 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.
- 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.
- 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.
- 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).
- Yuval Salant, 2003. "Limited Computational Resources Favor Rationality," Discussion Paper Series dp320, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Johnson, Mark R., 1990. "Information, associativity, and choice requirements," Journal of Economic Theory, Elsevier, vol. 52(2), pages 440-452, December.
- 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.
- Koshevoy, Gleb A., 1999. "Choice functions and abstract convex geometries," Mathematical Social Sciences, Elsevier, vol. 38(1), pages 35-44, July.
- Ballester, Coralio, 2004. "NP-completeness in hedonic games," Games and Economic Behavior, Elsevier, vol. 49(1), pages 1-30, October.
- Futia, Carl, 1977. "The complexity of economic decision rules," Journal of Mathematical Economics, Elsevier, vol. 4(3), pages 289-299, December.
- Amos Tversky & Itamar Simonson, 1993. "Context-Dependent Preferences," Management Science, INFORMS, vol. 39(10), pages 1179-1189, October.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Thomas Demuynck, 2014.
"The computational complexity of rationalizing Pareto optimal choice behavior,"
Social Choice and Welfare,
Springer;The Society for Social Choice and Welfare, vol. 42(3), pages 529-549, March.
- Thomas DEMUYNCK, 2011. "The computational complexity of rationalizing Pareto optimal choice behavior," Working Papers Department of Economics ces11.13, KU Leuven, Faculty of Economics and Business, Department of Economics.
- Thomas Demuynck, 2014. "The computational complexity of rationalizing Pareto optimal choice behavior," ULB Institutional Repository 2013/251999, ULB -- Universite Libre de Bruxelles.
- Smeulders, Bart & Cherchye, Laurens & De Rock, Bram & Spieksma, Frits C.R. & Talla Nobibon, Fabrice, 2015. "Complexity results for the weak axiom of revealed preference for collective consumption models," Journal of Mathematical Economics, Elsevier, vol. 58(C), pages 82-91.
- Mandler, Michael, 2015. "Rational agents are the quickest," Journal of Economic Theory, Elsevier, vol. 155(C), pages 206-233.
- Demuynck, Thomas, 2011.
"The computational complexity of rationalizing boundedly rational choice behavior,"
Journal of Mathematical Economics,
Elsevier, vol. 47(4-5), pages 425-433.
- Thomas Demuynck, 2011. "The computational complexity of rationalizing boundedly rational choice behavior," ULB Institutional Repository 2013/252242, ULB -- Universite Libre de Bruxelles.
- García-Sanz, María D. & Alcantud, José Carlos R., 2015. "Sequential rationalization of multivalued choice," Mathematical Social Sciences, Elsevier, vol. 74(C), pages 29-33.
- Salvador Barberà & Alejandro Neme, 2015. "Ordinal Relative Satisficing Behavior: Theory and Experiments," Working Papers 790, Barcelona Graduate School of Economics.
- COSAERT Sam, 2017. "What types are there?," LISER Working Paper Series 2017-01, LISER.
- Ronen Gradwohl & Eran Shmaya, 2013. "Tractable Falsifiability," Discussion Papers 1564, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- repec:eee:mateco:v:71:y:2017:i:c:p:63-73 is not listed on IDEAS
More about this item
Keywords
Rationalization Computational complexity NP-complete Arbitrary choice domains;Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:mateco:v:46:y:2010:i:3:p:356-363. 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: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/locate/jmateco .
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 CitEc recognized a reference but did not link an item in RePEc 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 RePEc Author Service 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.