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

Two notions of stability, ex ante stability and Bayesian stability, are investigated in a matching model with non-transferrable utility, interdependent preferences, and one-sided incomplete information. Ex ante stable matching-outcomes are unblocked for every belief on the blocking partner's...

The National Resident Matching program strives for a stable matching of medical students to teaching hospitals. With the presence of couples, stable matchings need not exist. For any student preferences, we show that each instance of a stable matching problem has a 'nearby' instance with a table...