We study the slot allocation problem where agents have quasi-linear single-peaked preferences over slots and identify the rules satisfying efficiency, strategy-proofness, and individual rationality. Since the quasi-linear single-peaked domain is not connected, the famous characterization of the...

We show that there is no consistent Pareto improvement over any stable mechanism. To overcome this impossibility, we introduce the following weak consistency requirement: Whenever a set of students, each of whom is assigned to a school that is under-demanded at the student-optimal stable...

We consider the problem of allocating multiple units of an indivisible object among agents and collecting payments. Each agent can receive multiple units of the object, and his (consumption) bundle is a pair of the units he receives and his payment. An agent's preference over bundles may be...

We experimentally study the Gale and Shapley (1962) mechanism, which is utilized in a wide set of applications, most prominently the National Resident Match- ing Program (NRMP). Several insights come out of our analysis. First, only 48% of our observed outcomes are stable, and among those a...

We consider the problem of matching a set of medical students to a set of medical residency positions (hospitals) under the assumption that hospitals' preferences over groups of students are responsive. In this context, we study the preference revelation game induced by the student proposing...

We develop a model of assignment games with pairwise-identitydependent externalities. A concept of conjectural equilibrium is proposed, and the universal conjecture is shown to be the necessary and sufficient condition for the general existence of equilibrium. We then apply the solution concept...

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

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 investigate the similarities and differences between matching markets and other canonical economic settings in the presence of complementarity. In particular, we explain the formal connections between the structure of matching markets with complementary contracts and games with strategic...

Online platforms that match customers with service providers utilize a wide variety of designs: some implement a searchable directory of one side of the market (i.e., Airbnb, Google Local Services); some allow both sides of the market to search and initiate contact (i.e., Upwork, Care.com);...