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. © 2013 Springer-Verlag.
CITATION STYLE
Altman, E., & Jiménez, T. (2013). Admission control to an M/M/1 queue with partial information. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7984 LNCS, pp. 12–21). https://doi.org/10.1007/978-3-642-39408-9_2
Mendeley helps you to discover research relevant for your work.