Equilibrium Arrivals to Preemptive Queueing System with Fixed and Random Population Size  

作　　者：Julia Chirkova Vladimir Mazalov 

机构地区：[1]Institute of Applied Mathematical Research,Karelian Research Centre of RAS,Petrozavodsk,185910,Russia [2]School of Mathematics and Statistics,Qingdao University,Qingdao,266071,Shandong,China

出　　处：《Journal of the Operations Research Society of China》2024年第1期77-92,共16页中国运筹学会会刊（英文）

基　　金：supported by the Russian Science Foundation(No.22-11-20015,https://rscf.ru/project/22-11-20015/);jointly with support of the authorities of the Republic of Karelia with funding from the Venture Investment Foundation of the Republic of Karelia.Also the research was supported by the National Natural Science Foundation of China(No.72171126).

摘　　要：A single-server queueing system with preemptive access is considered.Each customer has one attempt to enter the system at its working interval[0,T].As soon as the customer request enters the system,the server immediately starts the service.But when the next request arrives in the system,the previous one leaves the system even he has not finished his service yet.We study a non-cooperative game in which the customers wish to maximize their probability of obtaining service within a certain period of time.We characterize the Nash equilibrium and the price of anarchy,which is defined as the ratio between the optimal and equilibrium social utility.Two models are considered.In the first model the number of players is fixed,while in the second it is random and obeys the Poisson distribution.We demonstrate that there exists a unique symmetric equilibrium for both models.Finally,we calculate the price of anarchy for both models and show that the price of anarchy is not monotone with respect to the number of customers.

关 键 词：Service system Preemptive priorities Strategic users Random number of players Optimal arrivals Kolmogorov backward equations Nash equilibrium Price of anarchy 

分 类 号：O17[理学—数学]