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...

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

This article uses random and fixed effects regressions with 743,788 observations from panels of East and West Germany, the UK, Australia, South Korea, Russia, Switzerland and the United States. It shows how the life satisfaction of men and especially fathers in these countries increases steeply...

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...

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...