On the complexity of testing the collective axiom of revealed preference (Q2638309): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.mathsocsci.2010.06.004 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2046938687 / rank | |||
Normal rank |
Revision as of 21:58, 19 March 2024
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
collective axiom of revealed preference
0 references
NP-complete
0 references
not-all-equal-3Sat problem
0 references