✦ LIBER ✦

On the complexity of testing the Collective Axiom of Revealed Preference

✍ Scribed by Fabrice Talla Nobibon; Frits C.R. Spieksma

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 461 KB
Volume: 60
Category: Article
ISSN: 0165-4896
DOI: 10.1016/j.mathsocsci.2010.06.004

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

A note on the computability of tests of

A note on the computability of tests of the strong axiom of revealed preference

✍ Daniel McFadden 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 120 KB

Gross substitutability and the weak axio

Gross substitutability and the weak axiom of revealed preference

✍ Timothy J. Kehoe 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 841 KB

Continuous choice functions and the stro

Continuous choice functions and the strong axiom of revealed preference

✍ Walter Bossert 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 346 KB

What kind of preference maximization doe

What kind of preference maximization does the weak axiom of revealed non-inferiority characterize?

✍ Michele Lombardi 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 231 KB

Revealed preference theory on the choice

Revealed preference theory on the choice of lotteries

✍ Taesung Kim 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 652 KB

On the complexity of diagram testing

✍ Graham Brightwell 📂 Article 📅 1993 🏛 Springer Netherlands 🌐 English ⚖ 483 KB