Many centralized matching markets are preceded by interviews between participants, including the residency matches between doctors and hospitals. Due to the COVID-19 pandemic, interviews in the National Resident Matching Program were switched to a virtual format, which resulted in a dramatic and...

Lotteries are a common way to resolve ties in assignment mechanisms that ration resources. We consider a model with a continuum of agents and a finite set of re- sources with heterogeneous qualities, where the agents’ preferences are generated from a multinomial-logit (MNL) model based on the...

Manipulability is a threat to the successful design of centralized matching markets. However, in many applications some manipulation is inevitable and the designer wants to compare manipulable mechanisms. We count the number of agents with an incentive to manipulate and rank mechanisms by their...

This paper develops a framework for studying repeated matching markets. The model departs from the Gale-Shapley matching model by having a fixed set of long-lived players (firms) match with a new generation of short-lived players (workers) in every period. I define history-dependent and...

This paper develops an integer programming approach to two-sided many-to-one matching by investigating stable integral matchings of a fictitious market where each worker is divisible. We show that stable matching exists in a discrete matching market when firms' preference profile satisfies a...

In the United States, prospective foster parents must become licensed by a child welfare agency before a foster child can be placed in their care. This paper contributes by developing a theoretical matching model to study the optimal menu of licenses designed to screen foster parents. We...

Increasingly, more school districts across the US are using centralized admissions for charter, magnet, and neighborhood schools in a common enrollment system. We first show that, across all school-participation patterns, full participation in the common (or unified) enrollment system leads to...

Various forms of substitutability are essential for establishing the existence of equilibria and other useful properties in diverse settings such as matching, auctions, and exchange economies with indivisible goods. We extend earlier models' definitions of substitutability to settings in which...

The Stable Fixtures problem (Irving and Scott (2007)) is a generalized matching model that nests the well-known Stable Roommates, Stable Marriage, and College Admissions problems as special cases. This paper extends a result of the Stable Roommates problem to demonstrate that a class of...

We show how frictions and continuous transfers jointly affect equilibria in a model of matching in trading networks. Our model incorporates distortionary frictions such as transaction taxes, bargaining costs, and incomplete markets. When contracts are fully substitutable for firms, competitive...