IDEAS home Printed from https://ideas.repec.org/a/eee/mateco/v46y2010i3p356-363.html
   My bibliography  Save this article

The Computational Complexity of Rationalizing Behavior

Author

Listed:
  • Apesteguia, Jose
  • Ballester, Miguel A.

Abstract

We 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.

Suggested Citation

  • Apesteguia, Jose & Ballester, Miguel A., 2010. "The Computational Complexity of Rationalizing Behavior," Journal of Mathematical Economics, Elsevier, vol. 46(3), pages 356-363, May.
    • Handle: RePEc:eee:mateco:v:46:y:2010:i:3:p:356-363
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304-4068(10)00014-5
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ariel Rubinstein, 2000. "Economics and Language," Online economics textbooks, SUNY-Oswego, Department of Economics, number lang1, March.
    2. Yuval Salant, 2003. "Limited Computational Resources Favor Rationality," NajEcon Working Paper Reviews 666156000000000082, www.najecon.org.
    3. 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.
    4. Apesteguia, Jose & Ballester, Miguel A., 2013. "Choice by sequential procedures," Games and Economic Behavior, Elsevier, vol. 77(1), pages 90-99.
    5. S. Illeris & G. Akehurst, 2001. "Introduction," The Service Industries Journal, Taylor & Francis Journals, vol. 21(1), pages 1-4, January.
    6. Campbell, Donald E, 1978. "Realization of Choice Functions," Econometrica, Econometric Society, vol. 46(1), pages 171-180, January.
    7. Paola Manzini & Marco Mariotti, 2007. "Sequentially Rationalizable Choice," American Economic Review, American Economic Association, vol. 97(5), pages 1824-1839, December.
    8. Johnson Mark R., 1995. "Ideal Structures of Path Independent Choice Functions," Journal of Economic Theory, Elsevier, vol. 65(2), pages 468-504, April.
    9. Gil Kalai & Ariel Rubinstein & Ran Spiegler, 2002. "Rationalizing Choice Functions By Multiple Rationales," Econometrica, Econometric Society, vol. 70(6), pages 2481-2488, November.
    10. 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.
    11. Yuval Salant, 2003. "Limited Computational Resources Favor Rationality," Discussion Paper Series dp320, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
    12. Johnson, Mark R., 1990. "Information, associativity, and choice requirements," Journal of Economic Theory, Elsevier, vol. 52(2), pages 440-452, December.
    13. 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.
    14. Koshevoy, Gleb A., 1999. "Choice functions and abstract convex geometries," Mathematical Social Sciences, Elsevier, vol. 38(1), pages 35-44, July.
    15. Ballester, Coralio, 2004. "NP-completeness in hedonic games," Games and Economic Behavior, Elsevier, vol. 49(1), pages 1-30, October.
    16. Futia, Carl, 1977. "The complexity of economic decision rules," Journal of Mathematical Economics, Elsevier, vol. 4(3), pages 289-299, December.
    17. Amos Tversky & Itamar Simonson, 1993. "Context-Dependent Preferences," Management Science, INFORMS, vol. 39(10), pages 1179-1189, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. 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.
    2. 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.
    3. Mandler, Michael, 2015. "Rational agents are the quickest," Journal of Economic Theory, Elsevier, vol. 155(C), pages 206-233.
    4. Demuynck, Thomas, 2011. "The computational complexity of rationalizing boundedly rational choice behavior," Journal of Mathematical Economics, Elsevier, vol. 47(4-5), pages 425-433.
    5. 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.
    6. Salvador Barberà & Alejandro Neme, 2015. "Ordinal Relative Satisficing Behavior: Theory and Experiments," Working Papers 790, Barcelona Graduate School of Economics.
    7. COSAERT Sam, 2017. "What types are there?," LISER Working Paper Series 2017-01, LISER.
    8. Ronen Gradwohl & Eran Shmaya, 2013. "Tractable Falsifiability," Discussion Papers 1564, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    9. repec:eee:mateco:v:71:y:2017:i:c:p:63-73 is not listed on IDEAS

    Corrections

    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.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.