Echenique, Lee, Shum, and Yenmez (2013) established the testable revealed preference restrictions for stable aggregate matching with transferable (TU) and non-transferable utility (NTU) and for extremal stable matchings. In this paper, we rephrase their restrictions in terms of properties on a...

We study the degree of falsifiability of theories of choice. A theory is easy to falsify if relatively small datasets are enough to guarantee that the theory can be falsified: the VC dimension of a theory is the largest sample size for which the theory is ''never falsifiable.'' VC dimension is...

This paper is concerned with the axiomatic foundation of the revealed preference theory. Many well-known results in literature rest upon the ability to choose over budget sets that contains only 2 or 3 elements, the situations which are not observable in real life. In order to give a more...

This paper is concerned with the axiomatic foundation of the revealed preference theory. Many well-known results in the literature rest upon the ability to choose over budget sets that contain only 2 or 3 elements. This paper shows that for any given choice function, many of the famous...

This article reviews recent developments in revealed preference theory. It discusses the testable implications of theories of choice that are germane to specific economic environments. The focus is on expected utility in risky environments, subjected expected utility and maxmin expected utility...