To encourage diversity, branches may vary contracts' priorities across slots. The agents who match to branches, however, have preferences only over match partners and contractual terms. Ad hoc approaches to resolving agents' indifferences across slots in the Chicago and Boston school choice...

Motivated by historically low retention rates of graduates at USMA and ROTC, the Army recently introduced branch-for-service incentives programs where cadets could bid an additional three years of active duty service obligation to obtain higher priority for their desired career specialties. The...

Branch selection is a key decision in a cadet's military career. Cadets at USMA can increase their branch priorities at a fraction of slots by extending their service agreement. This real-life matching problem fills an important gap in market design literature. Although priorities fail a key...

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

We study a generalization of Shapley-Scarf's (1974) economy in which multiple types of indivisible goods are traded. We show that many of the distinctive results from the Shapley-Scarf economy do not carry over to this model, even if agents' preferences are strict and can be represented by...

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

Random mechanisms have been used in real-life situations for reasons such as fairness. Voting and matching are two examples of such situations. We investigate whether desirable properties of a random mechanism survive decomposition of the mechanism as a lottery over deterministic mechanisms that...

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