Stability and median rationalizability for aggregate matchings

Federico Echenique, SangMok Lee, Matthew Shum and M. Bumin Yenmez

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.

MoreLess

Year of publication:	2021
Authors:	Echenique, Federico ; Lee, SangMok ; Shum, Matthew ; Yenmez, M. Bumin
Published in:	Games. - Basel : MDPI, ISSN 2073-4336, ZDB-ID 2527220-2. - Vol. 12.2021, 2, Art.-No. 33, p. 1-15
Subject:	aggregate matching \| lattice \| median stable matching \| rationalizability \| Matching \| Suchtheorie \| Search theory \| Spieltheorie \| Game theory \| Aggregation

Type of publication:	Article
Type of publication (narrower categories):	Aufsatz in Zeitschrift ; Article in journal
Language:	English
Other identifiers:	10.3390/g12020033 [DOI] hdl:10419/257515 [Handle]
Source:	ECONIS - Online Catalogue of the ZBW

Persistent link: https://www.econbiz.de/10012503794