期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Equilibrium Arrivals to Preemptive Queueing System with Fixed and Random Population Size
1
作者 julia chirkova Vladimir Mazalov 《Journal of the Operations Research Society of China》 EI CSCD 2024年第1期77-92,共16页
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 immediat... 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
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部