Admission Control to an M/M/1 Queue with Partial Information
We consider both cooperative as well as non-cooperative admission into an M/M/1 queue. The only information available is a signal that says whether the queue size is smaller than some L or not. We first compute the globally optimal and the Nash equilibrium stationary policy as a function of L. We compare the performance to that of full information on the queue size. We identify the L that optimizes the equilibrium performance.
KeywordsOptimal Policy Queue Length Admission Control Partial Information Queue Size
Unable to display preview. Download preview PDF.
- 11.Spieksma, F.: Geometrically Ergodic Markov Chains and the Optimal Control of Queues. PhD thesis, Leiden University (1990)Google Scholar