We consider a congested facility where agents can line up at any time they wish after the facility opens (like airplane boarding, or drivers leaving stadium parking lots after a sports event). We show that in Nash equilibrium, within the general family of stochastic queue disciplines with no...

We consider the problem of assigning agents to slots on a line, where only one agent can be served at a slot and each agent prefers to be served as close as possible to his target. Our focus is on aggregate gap minimizing methods, i.e., those that minimize the total gap between targets and...

We consider a class of three-player queuing games where players independently choose when to arrive at a bottleneck facility that serves only one at a time. Players are impatient for service but cannot arrive before the facility opens and they dislike time spent in queue. We derive the...