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 October 8, 2010 | Accepted Version
Report Open

Aggregate Matchings


This paper characterizes the testable implications of stability for aggregate matchings. We consider data on matchings where individuals are aggregated, based on their observable characteristics, into types, and we know how many agents of each type match. We derive stability conditions for an aggregate matching, and, based on these, provide a simple necessary and sufficient condition for an observed aggregate matching to be rationalizable (i.e. such that preferences can be found so that the observed aggregate matching is stable). Subsequently, we derive moment inequalities based on the stability conditions, and provide an empirical illustration using the cross-sectional marriage distributions across the US states.

Additional Information

Echenique thanks the Lee Center at Caltech, and the NSF, for funding related to this project. We also thank Pierre-Andre Chiappori, Aureo de Paula, Bernard Salanie, Leeat Yariv, and seminar participants at Boston College, Universitat Aut`onoma de Barcelona, Universidad de Vigo, UCLA, the 2010 CAPCP conference at Penn State, the Roth-Sotomayor Celebration in Duke University, and the 2010 Cowles Summer Conference at Yale, for helpful comments. Supplemental material includes 99 slides for the NBER Market Design Conference (Oct. 8, 2010)

Attached Files

Accepted Version - sswp1316.pdf


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

Additional details

August 19, 2023
December 22, 2023