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 …

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 …

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

The probabilistic serial rule is one of the most well-established and desirable rules for the
random assignment problem. We present the egalitarian simultaneous reservation social …

Abstract Bogomolnaia and Moulin (J Econ Theory 100: 295–328, 2001) show that there is
no rule satisfying stochastic dominance efficiency, equal treatment of equals and stochastic …

This paper generalizes the Probabilistic Serial (PS) mechanism of Bogomolnaia and Moulin
(2001) to matching markets with arbitrary constraints. The constraints are modeled as a set …

In the allocation of indivisible objects under weak priorities, a common practice is to break
the ties using a lottery and to randomize over deterministic mechanisms. Such …

We consider the problem of assigning objects probabilistically among a group of agents who
may have multi-unit demands. Each agent has linear preferences over the (set of) objects …

We provide efficient, fair, and non-manipulable mechanisms for the multi-type resource
allocation problems (MTRAs) and multiple assignment problems where agents have partial …

We propose multi-type probabilistic serial (MPS) and multi-type random priority (MRP) as
extensions of the well-known PS and RP mechanisms to the multi-type resource allocation …