论文信息 - Optimal information disclosure policies in a strategic queueing model

Optimal information disclosure policies in a strategic queueing model

We find the optimal policy for the information disclosure problem of the M/M/1 queue studied by Simhon etal. (2016). Our optimal disclosure policy is as follows: the service provider informs all customers of the queue length when the queue length is above a specified threshold and does not inform them when the queue length is below the threshold.

Bara Kim | Jeongsim Kim

[1] Quanyan Zhu,et al. Optimal information disclosure policies in strategic queueing games , 2016, Oper. Res. Lett..

[2] Vincent A. Knight,et al. Comparisons between observable and unobservable M/M/1 queues with respect to optimal customer behavior , 2013, Eur. J. Oper. Res..

[3] P. Naor. The Regulation of Queue Size by Levying Tolls , 1969 .

[4] Refael Hassin,et al. To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems , 2002 .

[5] Edieal J. Pinker,et al. The value of sharing lead time information , 2006 .

[6] Pengfei Guo,et al. The effects of the availability of waiting-time information on a balking queue , 2009, Eur. J. Oper. Res..

[7] Antonis Economou,et al. Optimal balking strategies and pricing for the single server Markovian queue with compartmented waiting space , 2008, Queueing Syst. Theory Appl..

[8] D. K. Hildebrand,et al. Congestion Tolls for Poisson Queuing Processes , 1975 .

[9] Hassin Refael,et al. Optimal control of a queue with high-low delay announcements: the significance of the queue , 2014, VALUETOOLS 2014.