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

DOI10.1016/0304-4068(79)90020-XMaRDI QIDQ599664zbMATH OpenWikidataFDO

Authors Daniel McFadden

Publication date 1979

Published in Journal of Mathematical Economics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-4068(79)90020-X

zbMATH Keywords

computability of testslocally non- satiated preference preorderrecursive computational algorithmstrong axiom of revealed preference

Mathematics Subject Classification ID

Individual preferences (91B08)

This page was built for publication: A note on the computability of tests of the strong axiom of revealed preference

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q599664)