Stability and Median Rationalizability for Aggregate Matchings
Keyword(s):
We develop the theory of stability for aggregate matchings used in empirical studies and establish fundamental properties of stable matchings including the result that the set of stable matchings is a non-empty, complete, and distributive lattice. Aggregate matchings are relevant as matching data in revealed preference theory. We present a result on rationalizing a matching data as the median stable matching.
1996 ◽
Vol 26
(4)
◽
pp. 463-477
◽
2000 ◽
Vol 16
(1)
◽
pp. 99-115
◽
Keyword(s):
2014 ◽
Vol 2014
◽
pp. 1-7
◽
2020 ◽
Vol 12
(1)
◽
pp. 299-316
◽