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

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

We consider a non-cooperative queueing environment where a finite number of customers independently choose when to arrive at a queueing system that opens at a given point in time and serves customers on a last-come first-serve preemptive-resume (LCFS-PR) basis. Each customer has a service time...

We examine a non-cooperative queueing game where a finite number of customers seek service at a bottleneck facility which opens at a given point in time. The facility servers one customer at a time on a first-come, first-serve basis and the amount of time required to service each customer is...