Fair division, a key concern in the design of many social institutions, has for 70 years been
the subject of interdisciplinary research at the interface of mathematics, economics, and …

Efficiency and symmetric treatment of agents are the primary goals of resource allocation in
environments without transfers. Focusing on ordinal mecha-nisms in which no small group …

This paper studies the problem of assigning a set of indivisible objects to a set of agents
when monetary transfers are not allowed and agents reveal only ordinal preferences, but …

Consider object exchange problems when each agent may be endowed with and consume
more than one object. For most domains of preferences, no rule satisfies efficiency, the …

We provide a new, welfarist, interpretation of the well-known Serial rule in the random
assignment problem, strikingly different from previous attempts to define or axiomatically …

Computational social choice is a research area at the intersection of computer science,
mathematics, and economics that is concerned with aggregation of preferences of multiple …

We consider the problem of allocating m objects to n agents. Each agent has unit demand,
and has strict preferences over the objects. There are qj units of object j available and the …

We study a probabilistic assignment problem when agents have multi-unit demands for
objects. We first introduce two fairness requirements to accommodate different demands …

We present a simple and natural non-pricing mechanism for allocating divisible goods
among strategic agents having lexicographic preferences. Our mechanism has favorable …

The probabilistic serial (PS) rule is one of the most prominent randomized rules for the
assignment problem. It is well-known for its superior fairness and welfare properties …