Loading…

On the complexity of testing the Collective Axiom of Revealed Preference

We prove that the problem of testing whether data of consumption expenditures satisfy the Collective Axiom of Revealed Preference (CARP) is an NP-complete problem.

Saved in:
Bibliographic Details
Published in:Mathematical social sciences 2010-09, Vol.60 (2), p.123-136
Main Authors: Talla Nobibon, Fabrice, Spieksma, Frits C.R.
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We prove that the problem of testing whether data of consumption expenditures satisfy the Collective Axiom of Revealed Preference (CARP) is an NP-complete problem.
ISSN:0165-4896
1879-3118
DOI:10.1016/j.mathsocsci.2010.06.004