On the complexity of testing the collective axiom of revealed preference
From MaRDI portal
Publication:2638309
DOI10.1016/j.mathsocsci.2010.06.004zbMath1232.91432OpenAlexW2046938687WikidataQ114013687 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
Related Items (5)
Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms ⋮ The computational complexity of rationalizing Pareto optimal choice behavior ⋮ Revealed preference theory: an algorithmic outlook ⋮ Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles ⋮ Complexity results for the weak axiom of revealed preference for collective consumption models
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
This page was built for publication: On the complexity of testing the collective axiom of revealed preference