The computational complexity of rationalizing Pareto optimal choice behavior

DOI10.1007/s00355-013-0735-1zbMath1302.91060MaRDI QIDQ483106

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 complexity; NP-complete; Pareto efficiency

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

91B06: Decision theory

Related Items

A characterization of the \(n\)-agent Pareto dominance relation, Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms

Cites Work

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