The computational complexity of rationalizing Pareto optimal choice behavior

DOI10.1007/S00355-013-0735-1MaRDI QIDQ483106zbMATH OpenOpenAlexFDO

Authors Thomas Demuynck

Publication date 15 December 2014

Published in Social Choice and Welfare (Search for Journal in Brave)

Full work available at URL https://dipot.ulb.ac.be/dspace/bitstream/2013/251999/3/005.pdf

zbMATH Keywords

computational complexityNP-completePareto efficiency

Mathematics Subject Classification ID

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

Recommendations

• The computational complexity of rationalizing behavior
• The computational complexity of rationalizing boundedly rational choice behavior
• Implications of Pareto efficiency for two-agent (household) choice
• Pareto rationalizability by two single-peaked preferences
• On the testable implications of collective choice theories

Cites work

• A Theorem on Boolean Matrices
• Core rationalizability in two-agent exchange economies.
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1554930 (Why is no real title available?)
• Implications of Pareto efficiency for two-agent (household) choice
• Maximal-element rationalizability
• On the complexity of testing the collective axiom of revealed preference
• On the testable implications of collective choice theories
• Paretian quasi-orders: the regular two-agent case
• Partially Ordered Sets
• Rationality, external norms, and the epistemic value of menus
• Rationalizability of choice functions by game trees
• Rationalizing Choice Functions By Multiple Rationales
• Revealed Preference Theory
• The Collective Model of Household Consumption: A Nonparametric Characterization
• The Complexity of the Partial Order Dimension Problem
• The computational complexity of rationalizing behavior
• The computational complexity of rationalizing boundedly rational choice behavior
• The Construction of Utility Functions from Expenditure Data
• The Nonparametric Approach to Demand Analysis

Cited in

(9)

• On the testable implications of collective choice theories
• The computational complexity of rationalizing boundedly rational choice behavior
• A characterization of the n-agent Pareto dominance relation
• Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms
• scientific article; zbMATH DE number 3961285 (Why is no real title available?)
• scientific article; zbMATH DE number 1850468 (Why is no real title available?)
• Implications of Pareto efficiency for two-agent (household) choice
• A behavioral choice model when computational ability matters
• The computational complexity of rationalizing behavior

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

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