Proofs of conjectures on the competition between observable and unobservable servers

DOI10.1007/s11134-023-09887-7zbMath1523.60151WikidataQ122904581 ScholiaQ122904581MaRDI QIDQ6063269

Jeongsim Kim, Chia-Li Wang, Yan Su, Bara Kim

Publication date: 7 November 2023

Published in: Queueing Systems (Search for Journal in Brave)

zbMATH Keywords

matrix analytic methodequilibrium strategycensored Markov chain

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25)

Cites Work

• Unnamed Item
• Unnamed Item
• To queue or not to queue: equilibrium behavior in queueing systems.
• On equilibrium threshold strategies when choosing between observable and unobservable queues
• Computational schemes for two exponential servers where the first has a finite buffer
• Optimal Routing Among ⋅/M/1 Queues with Partial Information
• Rational Queueing
• Congestion Tolls for Poisson Queuing Processes
• Introduction to Matrix Analytic Methods in Stochastic Modeling
• On the Advantage of Being the First Server
• The Regulation of Queue Size by Levying Tolls

This page was built for publication: Proofs of conjectures on the competition between observable and unobservable servers