Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published April 13, 2021 | Published
Journal Article Open

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.

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.

Attached Files

Published - games-12-00033-v2.pdf


Files (596.9 kB)
Name Size Download all
596.9 kB Preview Download

Additional details

August 22, 2023
October 23, 2023