On the complexity of testing the Collective Axiom of Revealed Preference

F.T. Nobibon; F.C.R. Spieksma

doi:10.1016/j.mathsocsci.2010.06.004

On the complexity of testing the Collective Axiom of Revealed Preference

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

Research output: Contribution to journal › Article › Academic › peer-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 language	English
Pages (from-to)	123-136
Journal	Mathematical Social Sciences
Volume	60
Issue number	2
DOIs	https://doi.org/10.1016/j.mathsocsci.2010.06.004
Publication status	Published - Sept 2010
Externally published	Yes

Keywords

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

Access to Document

10.1016/j.mathsocsci.2010.06.004

Cite this

@article{90088f5bb6fd41e2bc3965d55bc88622,

title = "On the complexity of testing the Collective Axiom of Revealed Preference",

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.",

keywords = "Collective Axiom of Revealed Preference, NP-complete, Not-All-Equal-3Sat problem",

author = "F.T. Nobibon and F.C.R. Spieksma",

year = "2010",

month = sep,

doi = "10.1016/j.mathsocsci.2010.06.004",

language = "English",

volume = "60",

pages = "123--136",

journal = "Mathematical Social Sciences",

issn = "0165-4896",

publisher = "Elsevier B.V.",

number = "2",

}

TY - JOUR

T1 - On the complexity of testing the Collective Axiom of Revealed Preference

AU - Nobibon, F.T.

AU - Spieksma, F.C.R.

PY - 2010/9

Y1 - 2010/9

N2 - 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.

AB - 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.

KW - Collective Axiom of Revealed Preference

KW - NP-complete

KW - Not-All-Equal-3Sat problem

U2 - 10.1016/j.mathsocsci.2010.06.004

DO - 10.1016/j.mathsocsci.2010.06.004

M3 - Article

SN - 0165-4896

VL - 60

SP - 123

EP - 136

JO - Mathematical Social Sciences

JF - Mathematical Social Sciences

IS - 2

ER -

On the complexity of testing the Collective Axiom of Revealed Preference

Abstract

Keywords

Access to Document

Fingerprint

Cite this