The computational complexity of rationalizing behavior

DOI10.1016/j.jmateco.2010.02.001zbMath1229.91099OpenAlexW2148444551MaRDI QIDQ972378

Jose Apesteguia, Miguel Ángel Ballester

Publication date: 25 May 2010

Published in: Journal of Mathematical Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmateco.2010.02.001

zbMATH Keywords

computational complexityNP-completerationalizationarbitrary choice domains

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decision theory (91B06)

Related Items

The complexity of shelflisting, Context dependent beliefs, Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms, The computational complexity of rationalizing boundedly rational choice behavior, Choice and individual welfare, Assent-maximizing social choice, The computational complexity of rationalizing Pareto optimal choice behavior, Rational agents are the quickest, Sequential rationalization of multivalued choice, Complexity results for the weak axiom of revealed preference for collective consumption models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Choice by sequential procedures
• A million answers to twenty questions: choosing by checklist
• Rationality from a computational standpoint
• The complexity of economic decision rules
• Choice functions and abstract convex geometries
• NP-completeness in hedonic games
• Ideal structures of path independent choice functions
• Rational agents are the quickest
• Information, associativity, and choice requirements
• Realization of Choice Functions
• Context-Dependent Preferences
• Rationalizing Choice Functions By Multiple Rationales
• Locally complete path independent choice functions and their lattices