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

We introduce a new notion of ex-post efficiency for random assignment problems, namely ex-post rank efficiency that gives a maximal number of agents their favored objects. An ex-post rank efficient random assignment is a lottery over rank efficient deterministic assignments, in the sense of...

Pathak and Sönmez (2013) provided support for many real-world school choice reforms by showing that the post-reform mechanisms are often “less manipulable” than the pre-reform mechanisms according to their criterion of manipulability. In many realistic preference domains including...

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

We explore the possibility of designing matching mechanisms that can accommodate non-standard choice behavior. We pin down the necessary and sufficient conditions on participants’ choice behavior for the existence of stable and incentive compatible mechanisms. Our results imply that...

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

We study a one-to-one two-sided matching market in which each man has a common value for all women and a private value specific to each woman. We introduce a new mechanism, called a proposing mechanism, which is a novel interpretation of the deferred acceptance mechanism. We show that these...

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

We study a new variant of the school choice problem in which capacities can be altered by distributing additional seats across schools in response to students’ reported preferences. We show that heuristics solutions to this capacity design problem can be inefficient, even if they focus on...