On the complexity of testing the collective axiom of revealed preference

DOI10.1016/j.mathsocsci.2010.06.004zbMath1232.91432WikidataQ114013687 ScholiaQ114013687MaRDI QIDQ2638309

Frits C. R. Spieksma, Fabrice Talla Nobibon

Publication date: 15 September 2010

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2010.06.004

zbMATH Keywords

NP-complete; collective axiom of revealed preference; not-all-equal-3Sat problem

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

91B42: Consumer behavior, demand theory

Related Items

The computational complexity of rationalizing Pareto optimal choice behavior, Revealed preference theory: an algorithmic outlook, Complexity results for the weak axiom of revealed preference for collective consumption models, Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles, Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms

Cites Work

• Unnamed Item
• The Nonparametric Approach to Demand Analysis
• Nonparametric tests of collectively rational consumption behavior: an integer programming procedure
• Heuristics for deciding collectively rational consumption behavior
• The Collective Model of Household Consumption: A Nonparametric Characterization