The computational complexity of rationalizing behavior

DOI10.1016/J.JMATECO.2010.02.001zbMATH Open1229.91099OpenAlexW2148444551MaRDI QIDQ972378FDOQ972378

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

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

zbMATH Keywords

computational complexityNP-completerationalizationarbitrary choice domains

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (21)

• Testing consumer rationality using perfect graphs and oriented discs
• Revealed preference theory: an algorithmic outlook
• Learnability and rationality of choice.
• Rationality, computability, and complexity
• Descriptive complexity and revealed preference theory
• On the computational complexity of consumer decision rules
• A behavioral choice model when computational ability matters
• Choice resolutions
• The computational complexity of rationalizing Pareto optimal choice behavior
• Rational agents are the quickest
• The complexity of shelflisting
• Computable preference and utility
• Choice and individual welfare
• Finite and infinite complexity in axioms of rational choice or Sen's characterization of preference-compatibility cannot be improved
• The computational complexity of rationalizing boundedly rational choice behavior
• Assent-maximizing social choice
• Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms
• Context dependent beliefs
• Title not available (Why is that?)
• 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)