A note on the computability of tests of the strong axiom of revealed preference (Q599664)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on the computability of tests of the strong axiom of revealed preference |
scientific article; zbMATH DE number 3644741
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the computability of tests of the strong axiom of revealed preference |
scientific article; zbMATH DE number 3644741 |
Statements
A note on the computability of tests of the strong axiom of revealed preference (English)
0 references
1979
0 references
computability of tests
0 references
strong axiom of revealed preference
0 references
locally non- satiated preference preorder
0 references
recursive computational algorithm
0 references
