We study a probabilistic assignment problem when agents have multi-unit demands for objects. We first introduce two fairness requirements to accommodate different demands across agents. We show that each of these requirements is incompatible with stochastic dominance efficiency (henceforth, we...

A group of agents are waiting for their job to be processed in a facility. We assume that each agent needs the same amount of processing time and incurs waiting costs. The facility has two parallel servers, being able to serve two agents at a time. We are interested in finding the order to serve...

We study the problem of assigning a set of objects to a set of agents, when each agent receives one object and has strict preferences over the objects. In the absence of monetary transfers, we focus on the probabilistic rules, which take the ordinal preferences as input. We characterize the...