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

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

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 objects to a group of agents, when each agent has ordinal preferences over the objects. We focus on probabilistic methods, in particular, the serial rule, introduced by Bogomolnaia and Moulin (2001). Liu and Pycia (2011) show that for each economy with "full...