Strategic arrivals to queues offering priority service

Rajat Talak (), D. Manjunath and Alexandre Proutiere
Additional contact information
Rajat Talak: Massachusetts Institute of Technology
D. Manjunath: Indian Institute of Technology Bombay
Alexandre Proutiere: KTH Royal Institute of Technology

Queueing Systems: Theory and Applications, 2019, vol. 92, issue 1, No 5, 103-130

Abstract: Abstract We consider strategic arrivals to a FCFS service system that starts service at a fixed time and has to serve a fixed number of customers, for example, an airplane boarding system. Arriving early induces a higher waiting cost (waiting before service begins) while arriving late induces a cost because earlier arrivals take the better seats. We first consider arrivals of heterogenous customers that choose arrival times to minimize the weighted sum of waiting cost and cost due to expected number of predecessors. We characterize the unique Nash equilibria for this system. Next, we consider a system offering L levels of priority service with a FCFS queue for each priority level. Higher priorities are charged higher admission prices. Customers make two choices—time of arrival and priority of service. We show that the Nash equilibrium corresponds to the customer types being divided into L intervals and customers belonging to each interval choosing the same priority level. We further analyze the net revenue to the server and consider revenue maximizing strategies—number of priority levels and pricing. Numerical results show that with only a small number of queues (two or three) the server can obtain nearly the maximum revenue.

Keywords: Games in queues; Strategic arrivals; Priority queues; Pricing; Service differentiation; 91A55; 91A13; 90B22 (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s11134-019-09604-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:queues:v:92:y:2019:i:1:d:10.1007_s11134-019-09604-3

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11134/

DOI: 10.1007/s11134-019-09604-3

Access Statistics for this article

Queueing Systems: Theory and Applications is currently edited by Sergey Foss

More articles in Queueing Systems: Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().