Please click here if you are unable to view this page.
TOPIC:
COARSE REVEALED PREFERENCE
ABSTRACT
We identify necessary and sufficient conditions under which a coarse data set can be rationalizable by a linear order. A coarse data set O is a tuple {(Ai,Bi)}ni=1 where Ai is a feasible set and Bi is a nonempty subset of Ai for each i. A coarse data set is rationalizable by a linear order if, for each i, the maximal element in Ai according to the linear order is contained in Bi. We apply our theory to investigate the observable restrictions of economic models including (i) revealed preference with imperfect observation; (ii) multiple preferences; (iii) revealed attention with incomplete data; and (iv) minimax regret. We also extend our analysis to cover weak orders.