We model a general choice environment via probabilistic choice correspondences, with (possibly) incomplete domain and infinite universal set of alternatives. We offer a consistency restriction regarding choice when the feasible set contracts. This condition, ‘contraction consistency’, subsumes earlier notions such as Chernoff’s Condition, Sen’s a and ß, and regularity. We identify a restriction on the domain of the stochastic choice correspondence, under which contraction consistency is equivalent to the weak axiom of revealed preference in its most general form. When the universal set of alternatives is finite, this restriction is also necessary for such equivalence. Analogous domain restrictions are also identified for the special case where choice is deterministic but possibly multi-valued. Results due to Sen (Rev Econ Stud 38: 307-317, 1971) and Dasgupta and Pattanaik (Econ Theory 31: 35-50, 2007) fall out as corollaries. Thus, conditions are established, under which our notion of consistency, articulated only in reference to contractions of the feasible set, suffices as the axiomatic foundation for a general revealed preference theory of choice behaviour.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by University of Nottingham, School of Economics in its series Discussion Papers with number
08/04.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
WILLIAM J. McCAUSLAND, 2009.
"Random Consumer Demand,"
Economica,
London School of Economics and Political Science, vol. 76(301), pages 89-107, 02.
[Downloadable!] (restricted)