Agents with reciprocal preferences prefer to be matched to a partner who also likes to collaborate with them. In this paper, we introduce and formalize reciprocal preferences, apply them to matching markets, and analyze the implications for mechanism design. Formally, the preferences of an agent...

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

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

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

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

Motivated by school admission systems used in, e.g., Turkey and Sweden, this paper investigates a sequential two-stage admission system with public and private schools. To perform the analysis, relevant axioms and equilibrium notions need to be tailored for the considered dynamic setting. In...

We introduce a general class of simplicity standards that vary the foresight abilities required of agents in extensive-form games. Rather than planning for the entire future of a game, agents are presumed to be able to plan only for those histories they view as simple from their current...

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

This study considers a school choice problem with general feasibility constraints. Each student belongs to a grade; and two students belonging to the same grade are symmetric, whereas those belonging to different grades can be asymmetric with respect to the feasibility constraint of a school. We...

This study observes that no group strategy-proof mechanism satisfies even a fairly weak notion of stability in a school choice setting. In response to this result, we introduce two monotonicity axioms, which we call top-dropping monotonicity and extension monotonicity, as alternatives to group...