We find the optimal policy for the information disclosure problem of the M/M/1 queue studied by Simhon et al. (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.
Bibliographical noteFunding Information:
We are grateful to the reviewer for valuable comments and suggestions, which greatly improved this paper. B. Kim's research was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIP) (No. 2014R1A2A2A01005831). J. Kim's research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (2014R1A1A4A01003813).
© 2017 Elsevier B.V.
- Equilibrium strategies
- Optimal policies
- Queueing model
ASJC Scopus subject areas
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics