Evidence suggests that participants in direct student-proposing deferred-acceptance mechanisms (DA) play dominated strategies. To explain the data, we introduce expectation-based loss aversion into a school-choice setting and characterize choice-acclimating personal equilibria in DA. We find...

This paper justifies the evolution of the college admissions system in China from a mechanism design perspective. The sequential choice algorithm and the parallel choice algorithm used in the context of China's college admissions system are formulated as the well-studied Boston mechanism and the...

Despite the truthful dominant strategy, participants in strategy-proof me- chanisms submit manipulated preferences. In our model, participants dislike rejections and enjoy the confirmation from getting what they declared most desirable. Formally, the payoff from a match decreases in its position...

Dozens of school districts and college admissions systems around the world have reformed their admissions rules in recent years. As the main motivation for these reforms, the policymakers cited the strategic flaws of the rules in place: students had incentives to game the system. However, after...

This paper focuses on indivisible multiple-cost–single-benefit projects that must be approved by the government. A simple mechanism is proposed that ensures an efficient and fair implementation of such projects. The proposed mechanism is appropriate for a unilateral information structure: the...

We run laboratory experiments where subjects are matched to colleges, and colleges are not strategic agents. We test the Gale-Shapley Deferred Acceptance (DA) mechanism versus the Iterative Deferred Acceptance Mechanism (IDAM), a matching mechanism based on a new family of procedures being used...

We introduce a new mechanism for matching students to schools or universities, denoted Iterative Deferred Acceptance Mechanism (IDAM), inspired by procedures currently being used to match millions of students to public universities in Brazil and China. Unlike most options available in the...

This paper introduces a mechanism design approach that allows dealing with the multiple equilibrium problem, using mechanisms that are robust to bounded rationality. This approach is a tool for constructing supermodular mechanisms, i.e. mechanisms that induce games with strategic...

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

A new mechanism was introduced in New York City and Boston to assign students to public schools. This mechanism was advocated for its superior fairness property, besides others. We introduce a new framework for school-choice problems and two notions of fairness in lottery design based on ex-ante...