CaltechAUTHORS
  A Caltech Library Service

Stability and Median Rationalizability for Aggregate Matchings

Echenique, Federico and Lee, SangMok and Shum, Matthew and Yenmez, M. Bumin (2021) Stability and Median Rationalizability for Aggregate Matchings. Games, 12 (2). Art. No. 33. ISSN 2073-4336. doi:10.3390/g12020033. https://resolver.caltech.edu/CaltechAUTHORS:20210503-143303932

[img]
Preview
PDF - Published Version
Creative Commons Attribution.

596kB

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20210503-143303932

Abstract

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.


Item Type:Article
Related URLs:
URLURL TypeDescription
https://doi.org/10.3390/g12020033DOIArticle
ORCID:
AuthorORCID
Echenique, Federico0000-0002-1567-6770
Shum, Matthew0000-0002-6262-915X
Additional Information:© 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Received: 3 March 2021; Accepted: 25 March 2021; Published: 9 April 2021. Author Contributions: All authors have equally contributed to all parts of the paper. All authors have read and agreed to the published version of the manuscript. This research received no external funding. The authors declare no conflict of interest.
Subject Keywords:aggregate matching; median stable matching; rationalizability; lattice
Issue or Number:2
DOI:10.3390/g12020033
Record Number:CaltechAUTHORS:20210503-143303932
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20210503-143303932
Official Citation:Echenique, F.; Lee, S.; Shum, M.; Yenmez, M.B. Stability and Median Rationalizability for Aggregate Matchings. Games 2021, 12, 33. https://doi.org/10.3390/g12020033
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:108948
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:03 May 2021 21:56
Last Modified:03 May 2021 21:56

Repository Staff Only: item control page