Stability and median rationalizability for aggregate matchings (Q2052526)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Stability and median rationalizability for aggregate matchings |
scientific article; zbMATH DE number 7434032
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Stability and median rationalizability for aggregate matchings |
scientific article; zbMATH DE number 7434032 |
Statements
Stability and median rationalizability for aggregate matchings (English)
0 references
26 November 2021
0 references
Summary: 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.
0 references
aggregate matching
0 references
median stable matching
0 references
rationalizability
0 references
lattice
0 references
