On the complexity of testing the collective axiom of revealed preference (Q2638309)

From MaRDI portal
Revision as of 05:47, 3 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the complexity of testing the collective axiom of revealed preference
scientific article

    Statements

    On the complexity of testing the collective axiom of revealed preference (English)
    0 references
    15 September 2010
    0 references
    0 references
    collective axiom of revealed preference
    0 references
    NP-complete
    0 references
    not-all-equal-3Sat problem
    0 references
    0 references
    0 references