The Computational Complexity of Rationalizing Behavior
Authors:
- Jose ApesteguiaJAJose Apesteguia
- Miguel A. BallesterMBMiguel A. Ballester
- 1 May 2010
- journal article
- Published by Elsevier in Journal of Mathematical Economics
- Vol. 46 (3) , 356-363
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Fact-Free LearningAmerican Economic Review, 2005
- NP-completeness in hedonic gamesGames and Economic Behavior, 2004
- Rationalizing Choice Functions By Multiple RationalesEconometrica, 2002
- Locally complete path independent choice functions and their latticesMathematical Social Sciences, 2001
- Choice functions and abstract convex geometriesMathematical Social Sciences, 1999
- Ideal Structures of Path Independent Choice FunctionsJournal of Economic Theory, 1995
- Information, associativity, and choice requirementsJournal of Economic Theory, 1990
- Rationality from a computational standpointTheory and Decision, 1978
- Realization of Choice FunctionsEconometrica, 1978
- The complexity of economic decision rulesJournal of Mathematical Economics, 1977