Patients needing kidney transplants may have willing donors who cannot donate to them because of blood or tissue incompatibility. Incompatible patient-donor pairs can exchange donor kidneys with other such pairs. The situation facing such pairs resem- bles models of the double coincidence of...

In connection with an earlier paper on the exchange of live donor kidneys (Roth, Sönmez, and Ünver 2004) the authors entered into discussions with New England transplant surgeons and their colleagues in the transplant community, aimed at implementing a Kidney Exchange program. In the course of...

Mechanisms that rely on course bidding are widely used at Business Schools in order to allocate seats at oversubscribed courses. Bids play two key roles under these mechanisms: Bids are used to infer student preferences and bids are used to determine who have bigger claims on course seats. We...

We analyze mechanisms to kidney exchange with good samaritan donors where exchange is feasible not only among donor-patient pairs but also among such pairs and non-directed alturistic donors. We show that you request my donor-I get your turn mechanism (Abdulkadiroglu and Sonmez [1999]) is the...

In Fall 2009, officials from Chicago Public Schools changed their assignment mechanism for coveted spots at selective college preparatory high schools midstream. After asking about 14,000 applicants to submit their preferences for schools under one mechanism, the district asked them to re-submit...

In July 2005 the Boston School Committee voted to replace the existing Boston school choice mechanism with a deferred acceptance mechanism that simplifies the strategic choices facing parents. This paper presents the empirical case against the previous Boston mechanism, a priority matching...

It is known that in two-sided many-to-many matching problems, pairwise-stable matchings may not be immune to group deviations, unlike in many-to-one matching problems (Blair 1988). In this paper, we show that pairwise stability is equivalent to credible group stability when one side has...

In this paper, we analyze capacity manipulation games in hospital-intern markets inspired by the real-life entry-level labor markets for young physicians seeking residencies at hospitals. In these markets, where the matching is determined by a centralized clearinghouse called the National...

We analyze the core of a class of coalition formation game in which every player's payoff depends only on the members of her coalition. We first consider anonymous games and additively separable games. Neither of these strong properties guarantee the existence of a core allocation, even if...

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