Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/296396 
Year of Publication: 
2022
Citation: 
[Journal:] Theoretical Economics [ISSN:] 1555-7561 [Volume:] 17 [Issue:] 4 [Year:] 2022 [Pages:] 1651-1682
Publisher: 
The Econometric Society, New Haven, CT
Abstract: 
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 corresponding bipartite graph. From this, we obtain a simple condition that verifies whether a given aggregate matching is rationalisable. For matchings that are not rationalisable, we provide a simple greedy algorithm that computes the minimum number of matches that needs to be removed to obtain a rationalisable matching. We also show that the related problem of finding the minimum number of types that we need to remove in order to obtain a rationalisable matching is NP-complete.
Subjects: 
computational complexity
matroid
Revealed preference theory
stability
two-sided matching markets
JEL: 
C78
D11
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by-nc Logo
Document Type: 
Article

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.