matching with transferable (TU) and non-transferable utility (NTU) and for extremal stable matchings. In this paper, we … that verifies whether a given aggregate matching is rationalisable. For matchings that are not rationalisable, we provide a … matching. We also show that the related problem of finding the minimum number of types that we need to remove in order to …

This article reviews recent developments in revealed preference theory. It discusses the testable implications of … different qualifications depending on the functional forms in the theory under consideration …