The computational complexity of rationalizing behavior
From MaRDI portal
Publication:972378
DOI10.1016/j.jmateco.2010.02.001zbMath1229.91099MaRDI 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
Related Items
Choice and individual welfare, 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, Context dependent beliefs, The computational complexity of rationalizing boundedly rational choice behavior, Assent-maximizing social choice, The complexity of shelflisting, Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms
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