Name File Type Size Last Modified
  matlabcode 10/19/2021 03:56:PM
LICENSE.txt text/plain 14.6 KB 10/11/2019 10:32:PM

Project Citation: 

Nguyen, Thành, and Vohra, Rakesh. Replication data for: Near-Feasible Stable Matchings with Couples. Nashville, TN: American Economic Association [publisher], 2018. Ann Arbor, MI: Inter-university Consortium for Political and Social Research [distributor], 2019-10-12. https://doi.org/10.3886/E113003V1

Project Description

Summary:  View help for Summary The National Resident Matching program seeks a stable matching of medical students to teaching hospitals. With couples, stable matchings need not exist. Nevertheless, for any student preferences, we show that each instance of a matching problem has a "nearby" instance with a stable matching. The nearby instance is obtained by perturbing the capacities of the hospitals. In this perturbation, aggregate capacity is never reduced and can increase by at most four. The capacity of each hospital never changes by more than two.

Scope of Project

Subject Terms:  View help for Subject Terms NRMP; Matching test problems; Stable Matching
JEL Classification:  View help for JEL Classification
      C78 Bargaining Theory; Matching Theory
      D47 Market Design
      I11 Analysis of Health Care Markets
      J41 Labor Contracts
      J44 Professional Labor Markets; Occupational Licensing
Data Type(s):  View help for Data Type(s) other:; program source code

Methodology

Data Source:  View help for Data Source Synthetic Data

Related Publications

Published Versions

Export Metadata

Report a Problem

Found a serious problem with the data, such as disclosure risk or copyrighted content? Let us know.

This material is distributed exactly as it arrived from the data depositor. ICPSR has not checked or processed this material. Users should consult the investigator(s) if further information is desired.