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...

We show that the class of preferences satisfying the Gross Substitutes condition of Kelso and Crawford (1982) is strictly larger than the class of Endowed Assignment Valuations of Hatfield and Milgrom (2005), thus resolving the open question posed by the latter paper. In particular, our result...

We introduce a two-sided, many-to-one matching with contracts model in which agents with unit demand match to branches that may have multiple slots available to accept contracts. Each slot has its own linear priority order over contracts; a branch chooses contracts by filling its slots...

Several structural results for the set of competitive equilibria in trading networks with frictions are established: The lattice theorem, the rural hospitals theorem, the existence of side-optimal equilibria, and a group-incentive-compatibility result hold with imperfectly transferable utility...

I introduce a stability notion, dynamic stability, for two-sided dynamic matching markets where (i) matching opportunities arrive over time, (ii) matching is one-to-one, and (iii) matching is irreversible. The definition addresses two conceptual issues. First, since not all agents are available...

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 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...

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...