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

We consider the multi-object allocation problem with monetary transfers where each agent obtains at most one object (unit-demand). We focus on allocation rules satisfying individual rationality, non-waste fulness, equal treatment of equals, and strategy-proofness. Extending the result of...

Can mechanism design save democracy? We propose a simple design that offers a chance: individuals pay for as many votes as they wish using a number of "voice credits" quadratic in the votes they buy. Only quadratic cost induces marginal costs linear in votes purchased and thus welfare optimality...

This article explores the impact of procedural information on the behavior of applicants under two of the most commonly used school admissions procedures: the Gale-Shapley mechanism and the Boston mechanism. In a lab experiment, I compare the impact of information about the mechanism,...

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

We study the allocation of German lawyers to regional courts for legal trainee-ships. Because of excess demand in some regions lawyers often have to wait before being allocated. The currently used "Berlin" mechanism is not weakly Pareto efficient, does not eliminate justified envy and does not...

In many markets, sellers advertise their good with an asking price. This is a price at which the seller is willing to take his good off the market and trade immediately, though it is understood that a buyer can submit an offer below the asking price and that this offer may be accepted if the...

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

Why do some incomplete information markets feature intermediaries while others do not? I study the allocation of two goods in an incomplete information setting with a single principal, multiple agents with unit demand, and interdependent valuations. I construct a novel dynamic mechanism...