We introduce a new matching model to mimic two-sided exchange programs such as tuition and worker exchange, in which each firm has to avoid being a net-exporter of workers. These exchanges use decentralized markets, making it difficult to achieve a balance between exports and imports. We show...

A new centralized mechanism was introduced in New York City and Boston to assign students to public schools in district school-choice programs. This mechanism was advocated for its superior fairness property, besides others, over the mechanisms it replaced. In this paper, we introduce a new...

This paper studies the problem of assigning a set of indivisible objects to a set of agents when monetary transfers are not allowed. We offer two characterizations of the prominent lottery assignment mechanism called the probabilistic serial. We show that it is the only mechanism satisfying...

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 consider competitive markets for multiple commodities with endogenous formation of one- or two-person households. Within each two-person household, externalities from the partner's commodity consumption and unpriced actions are allowed. Each individual has two types of traits: observable...

Transitivity is a fundamental requirement for consistency. Legal systems, especially when composed over time and by different agencies, may encounter non-transitive cycles. This paper discusses a new solution to such cycles, namely setting the hierarchy of the relevant rules or preferences. The...

When aggregating individual preferences through the majority rule in an n-dimensional spatial voting model, the ‘worst-case’ scenario is a social choice configuration where no political equilibrium exists unless a super majority rate as high as 1 − 1/n is adopted. In this paper we assume...

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