The revealed preference theory of stable matchings with one-sided preferences
From MaRDI portal
Publication:2212761
DOI10.1016/j.geb.2020.08.015zbMath1452.91219OpenAlexW2986934952MaRDI QIDQ2212761
Rui Tang, Gaoji Hu, Jiangtao Li
Publication date: 24 November 2020
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://ink.library.smu.edu.sg/soe_research/2303
Related Items (2)
On the revealed preference analysis of stable aggregate matchings ⋮ Empirical content of classic assignment methods: jungle and market economy
Cites Work
- Unnamed Item
- Unnamed Item
- Every finite distributive lattice is a set of stable matchings
- Vacancy chains and equilibration in senior-level labor markets
- Substitutes and stability for matching with contracts
- The Revealed Preference Theory of Stable and Extremal Stable Matchings
- What Matchings Can Be Stable? The Testable Implications of Matching Theory
- Revealed Preference Theory
- On the lattice structure of the set of stable matchings for a many-to-one model∗
This page was built for publication: The revealed preference theory of stable matchings with one-sided preferences