Approximations for a queueing game model with join-the-shortest-queue strategy

DOI10.1007/S40305-021-00382-5MaRDI QIDQ6047579zbMATH OpenOpenAlexWikidataFDO

Authors Qihui Bu, Li-Wei Liu, Jiashan Tang, Yiqiang Q. Zhao

Publication date 12 September 2023

Published in Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2012.14955

zbMATH Keywords

game theoryMarkov processmean field limitqueueing systems

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Abstract: This paper investigates a partially observable queueing system with $N$ nodes in which each node has a dedicated arrival stream. There is an extra arrival stream to balance the load of the system by routing its customers to the shortest queue. In addition, a reward-cost structure is considered to analyze customers' strategic behaviours. The equilibrium and socially optimal strategies are derived for the partially observable mean field limit model. Then, we show that the strategies obtained from the mean field model are good approximations to the model with finite $N$ nodes. Finally, numerical experiments are provided to compare the equilibrium and socially optimal behaviours, including joining probabilities and social benefits for different system parameters.

Recommendations

• Mean-field game approach to admission control of an \(M/M/\infty \) queue with shared service cost
• Customers' joining behavior in an unobservable GI/Geo/m queue
• Strategic customer behavior in a queueing system with a loss subsystem
• A busy period approach to some queueing games
• Equilibrium threshold joining strategies in partially observable batch service queueing systems

Cites work

• Congestion Tolls for Poisson Queuing Processes
• Decay of tails at equilibrium for FIFO join the shortest queue networks
• Equilibrium joining strategy in a batch transfer queuing system with gated policy
• scientific article; zbMATH DE number 3951715 (Why is no real title available?)
• scientific article; zbMATH DE number 934476 (Why is no real title available?)
• Join the shortest queue with many servers. The heavy-traffic asymptotics
• Join the shortest queue: Stability and exact asymptotics
• Mean-field game approach to admission control of an \(M/M/\infty \) queue with shared service cost
• Performance analysis of joining the shortest queue model among a large number of queues
• Rational queueing
• The Impact of Inspection Cost on Equilibrium, Revenue, and Social Welfare in a Single-Server Queue
• The power of slightly more than one sample in randomized load balancing
• The Regulation of Queue Size by Levying Tolls
• The supermarket game
• Two parallel queues with infinite servers and \textit{join the shortest queue} discipline
• TWO QUEUES IN PARALLEL
• Two Similar Queues in Parallel

Cited in

(3)

• Dynamic Admission Game into an M/M/1 Queue
• Welfare lower bounds and strategy-proofness in the queueing problem
• scientific article; zbMATH DE number 2202833 (Why is no real title available?)

This page was built for publication: Approximations for a queueing game model with join-the-shortest-queue strategy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6047579)