We study self-selection in centralized school choice, a strategy that takes place when students submit preferences before knowing their priorities at schools. A student self-selects if she decides not to apply to some schools despite being desirable. We give a theoretical explanation for this...

We model platform markets with the matching-with-contracts framework. The solution concept in matching with contracts, stability, has a natural interpretation in platform markets. We use this framework to explore properties in these markets including seesaw principle and market tipping. Finally,...

For an incompatible patient-donor pair, kidney exchanges often forbid receipt-before-donation (the patient receives a kidney before the donor donates) and donation-before-receipt, causing a double-coincidence-of-wants problem. Our proposal, the Unpaired kidney exchange algorithm, uses...

We study many-to-one matching with complementarities. Real life examples include college admissions with two-sided monetary transfers, teacher assignment with different teaching loads, worker assignment. Due to the presence of complementarities, the conditions that are essential for the...

This paper shows that the deferred acceptance mechanism (DA) cannot be improved upon in terms of manipulability in the sense of either Pathak and Sönmez (2013) or Arribillaga and Massó (2015) without compromising with stability. A conflict between manipulability and fairness is also...

I model access to influence as a two-sided matching market between a continuum of experts and two vertically differentiated gatekeepers under sequential directed search. Real-world examples include academic publishing, venture capital, job search or political agenda setting. The equilibrium is...

We provide priority-constrained versions of the ordinal efficiency welfare theorem for school choice lotteries. Moreover, we show that a constrained version of a cardinal second welfare theorem fails to hold, but can be restored for a relaxed notion of equilibrium with priority-specific prices

We evaluate the goal of maximizing the number of individually rational assignments. We show that it implies incentive, fairness, and implementation impossibilities. Despite that, we present two classes of mechanisms that maximize assignments. The first are Pareto efficient, and undominated –...

Each capacity-filling and substitutable choice rule is known to have a maximizer-collecting representation: there exists a list of priority orderings such that from each choice set that includes more alternatives than the capacity, the choice is the union of the priority orderings' maximizers...