The computational complexity of rationalizing behavior

DOI10.1016/J.JMATECO.2010.02.001MaRDI QIDQ972378zbMATH OpenOpenAlexFDO

Authors Jose Apesteguia, Miguel A. 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

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

Recommendations

• The computational complexity of rationalizing boundedly rational choice behavior
• The computational complexity of rationalizing Pareto optimal choice behavior
• Testing consumer rationality using perfect graphs and oriented discs
• Rationality, computability, and complexity
• Rationalizing Choice Functions By Multiple Rationales

Cites work

• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A million answers to twenty questions: choosing by checklist
• Choice by sequential procedures
• Choice functions and abstract convex geometries
• Context-Dependent Preferences
• Ideal structures of path independent choice functions
• Information, associativity, and choice requirements
• Introduction to algorithms
• Locally complete path independent choice functions and their lattices
• NP-completeness in hedonic games
• Rational agents are the quickest
• Rationality from a computational standpoint
• Rationalizing Choice Functions By Multiple Rationales
• Realization of Choice Functions
• The complexity of economic decision rules

Cited in

(21)

• Choice resolutions
• scientific article; zbMATH DE number 7730634 (Why is no real title available?)
• Rationality, computability, and complexity
• Context dependent beliefs
• Testing consumer rationality using perfect graphs and oriented discs
• Revealed preference theory: an algorithmic outlook
• The computational complexity of rationalizing boundedly rational choice behavior
• Learnability and rationality of choice.
• Rational agents are the quickest
• The complexity of shelflisting
• Finite and infinite complexity in axioms of rational choice or Sen's characterization of preference-compatibility cannot be improved
• Computable preference and utility
• Assent-maximizing social choice
• Choice and individual welfare
• Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms
• On the computational complexity of consumer decision rules
• A behavioral choice model when computational ability matters
• The computational complexity of rationalizing Pareto optimal choice behavior
• Descriptive complexity and revealed preference theory
• Complexity results for the weak axiom of revealed preference for collective consumption models
• Sequential rationalization of multivalued choice

This page was built for publication: The computational complexity of rationalizing behavior

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972378)