Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
A note on the computability of tests of the strong axiom of revealed preference - MaRDI portal

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

From MaRDI portal

Publication:599664

Jump to:navigation, search

DOI10.1016/0304-4068(79)90020-XzbMATH Open0414.90006WikidataQ114683717 ScholiaQ114683717MaRDI QIDQ599664

Daniel McFadden

Publication date: 1979

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

zbMATH Keywords

strong axiom of revealed preference computability of tests locally non- satiated preference preorder recursive computational algorithm

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:599664&oldid=12490104"