We study the indivisible object allocation problem without monetary transfer, in which each object is endowed with a weak priority ordering over agents. It is well known that stability is generally not compatible with efficiency in this problem. We characterize the priority structures for which...

We study the role of transfers in the timing of matching. In our model, some agents have the option of matching early and exiting in period 1, before others arrive in period 2; in period 2 there is a centralized institution that implements a stable matching after all agents arrive. We prove that...

We analyze multi-runway airport slot allocation problems during adverse weather. The number of slots assigned in any time interval is the same across feasible and non-wasteful landing schedules. The structure of the set of assigned slots is more complex than its counterpart in the single-runway...

I study a two-period matching model where one side of the market (e.g. workers) have an option to invest and delay matching in the first period. Investment increases each agent's matching surplus in the second period, by a magnitude of the worker's investment ability in the match pair. Assuming...

A choice rule with affirmative action decides on the recipients of a limited number of identical objects by reconciling two objectives: respecting a priority ordering over the applicants and supporting a minority group. We introduce axioms on choice rules based on the principle that affirmative...

We design and implement an iterative, program-proposing deferred acceptance mechanism with ties (IDAT) and apply it to childcare assignment in two German cities. The mechanism can accommodate complementarities in providers' preferences, is fast to terminate even in larger cities, is difficult to...

We introduce a generalization of the school choice problem motivated by the following observations: students are assigned to grades within schools, many students have siblings who are applying as well, and school districts commonly guarantee that siblings will attend the same school. This last...

Public school choice often yields student placements that are neither fair nor efficient. Kesten (2010) proposed an efficiency-adjusted deferred acceptance algorithm (EADAM) that allows students to consent to waive priorities that have no effect on their assignment. In this article, we provide...

I study how a matching platform's design affects users' welfare and probability of matching (outcomes) and the strategic decisions behind such a design. I consider a two-sided matching model in which each agent has a limited number of prospects. An increase in agents' number of prospects has two...