Artikel

Stability and median rationalizability for aggregate matchings

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.

Language
Englisch

Bibliographic citation
Journal: Games ; ISSN: 2073-4336 ; Volume: 12 ; Year: 2021 ; Issue: 2 ; Pages: 1-15 ; Basel: MDPI

Classification
Wirtschaft
Subject
aggregate matching
lattice
median stable matching
rationalizability

Event
Geistige Schöpfung
(who)
Echenique, Federico
Lee, SangMok
Shum, Matthew
Yenmez, M. Bumin
Event
Veröffentlichung
(who)
MDPI
(where)
Basel
(when)
2021

DOI
doi:10.3390/g12020033
Handle
Last update
10.03.2025, 11:44 AM CET

Data provider

This object is provided by:
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. If you have any questions about the object, please contact the data provider.

Object type

  • Artikel

Associated

  • Echenique, Federico
  • Lee, SangMok
  • Shum, Matthew
  • Yenmez, M. Bumin
  • MDPI

Time of origin

  • 2021

Other Objects (12)