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.
Year of publication: |
2010
|
---|---|
Authors: | Talla Nobibon, Fabrice ; Spieksma, Frits C.R. |
Published in: |
Mathematical Social Sciences. - Elsevier, ISSN 0165-4896. - Vol. 60.2010, 2, p. 123-136
|
Publisher: |
Elsevier |
Keywords: | Collective Axiom of Revealed Preference NP-complete Not-All-Equal-3Sat problem |
Saved in:
Saved in favorites
Similar items by person
-
Optimization models for targeted offers in direct marketing: Exact and heuristic algorithms
Talla Nobibon, Fabrice, (2011)
-
Optimization models for targeted offers in direct marketing: Exact and heuristic algorithms
Talla Nobibon, Fabrice, (2011)
-
Heuristics for deciding collectively rational consumption behavior
Nobibon, Fabrice Talla, (2008)
- More ...