In a moneyless market, a non storable, non transferable homogeneous commodity is reallocated between agents with single-peaked preferences. Agents are either suppliers or demanders. Transfers between a supplier and a demander are feasible only if they are linked, and the links form an arbitrary...

We consider the problem of allocating several types of indivisible goods when preferences are separable and monetary transfers are not allowed. Our finding is that the coordinatewise application of strategy-proof and non-wasteful rules yields a strategy-proof rule with the following efficiency...

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

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 consider a model of Paired Kidney Exchange (PKE) with feasibility constraints on the number of patient-donor pairs involved in exchanges. Patients' preferences are restricted so that patients prefer kidneys from compatible younger donors to kidneys from older donors. In this framework,...

The problem of allocating indivisible objects to different agents, where each individual is assigned at most one object, has been widely studied. Pápai (2000) shows that the set of strategy-proof, nonbossy, Pareto optimal and reallocation-proof rules are hierarchical exchange rules |...