On the complexity of testing the Collective Axiom of Revealed Preference

F.T. Nobibon, F.C.R. Spieksma

Research output: Contribution to journalArticleAcademicpeer-review

6 Citations (Scopus)

Abstract

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.
Original languageEnglish
Pages (from-to)123-136
JournalMathematical Social Sciences
Volume60
Issue number2
DOIs
Publication statusPublished - Sep 2010
Externally publishedYes

Keywords

  • Collective Axiom of Revealed Preference
  • NP-complete
  • Not-All-Equal-3Sat problem

Cite this