Abstract
We consider a Markovian clearing queueing system, where the customers are accumulated according to a Poisson arrival process and the server removes all present customers at the completion epochs of exponential service cycles. This system may represent the visits of a transportation facility with unlimited capacity at a certain station. The system evolves in an alternating environment that influences the arrival and the service rates. We assume that the arriving customers decide whether to join the system or balk, based on a natural linear reward-cost structure. We study the balking behavior of the customers and derive the corresponding Nash equilibrium strategies under various levels of information.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Artalejo, J. R., & Gomez-Corral, A. (1998). Analysis of a stochastic clearing system with repeated attempts. Communications in Statistics. Stochastic Models, 14, 623–645.
Burnetas, A., & Economou, A. (2007). Equilibrium customer strategies in a single server Markovian queue with setup times. Queueing Systems, 56, 213–228.
Economou, A. (2003). On the control of a compound immigration process through total catastrophes. European Journal of Operational Research, 147, 522–529.
Economou, A., & Fakinos, D. (2003). A continuous-time Markov chain under the influence of a regulating point process and applications in stochastic models with catastrophes. European Journal of Operational Research, 149, 625–640.
Economou, A., & Fakinos, D. (2008). Alternative approaches for the transient analysis of Markov chains with catastrophes. Journal of Statistical Theory and Practice, 2, 183–197.
Economou, A., & Kanta, S. (2008a). Optimal balking strategies and pricing for the single server Markovian queue with compartmented waiting space. Queueing Systems, 59, 237–269.
Economou, A., & Kanta, S. (2008b). Equilibrium balking strategies in the observable single-server queue with breakdowns and repairs. Operations Research Letters, 36, 696–699.
Edelson, N. M., & Hildebrand, K. (1975). Congestion tolls for Poisson queueing processes. Econometrica, 43, 81–92.
Gani, J., & Swift, R. J. (2007). Death and birth-death and immigration processes with catastrophes. Journal of Statistical Theory and Practice, 1, 39–48.
Guo, P., & Zipkin, P. (2007). Analysis and comparison of queues with different levels of delay information. Management Science, 53, 962–970.
Hassin, R. (2007). Information and uncertainty in a queuing system. Probability in the Engineering and Informational Sciences, 21, 361–380.
Hassin, R., & Haviv, M. (1997). Equilibrium threshold strategies: the case of queues with priorities. Operations Research, 45, 966–973.
Hassin, R., & Haviv, M. (2003). To queue or not to queue: equilibrium behavior in queueing systems. Boston: Kluwer Academic.
Kim, K., & Seila, A. F. (1993). A generalized cost model for stochastic clearing systems. Computers and Operations Research, 20, 67–82.
Kyriakidis, E. G. (1994). Stationary probabilities for a simple immigration-birth-death process under the influence of total catastrophes. Statistics and Probability Letters, 20, 239–240.
Kyriakidis, E. G. (1999a). Optimal control of a truncated general immigration process through total catastrophes. Journal of Applied Probability, 36, 461–472.
Kyriakidis, E. G. (1999b). Characterization of the optimal policy for the control of a simple immigration process through total catastrophes. Operations Research Letters, 24, 245–248.
Kyriakidis, E. G., & Dimitrakos, T. D. (2005). Computation of the optimal policy for the control of a compound immigration process through total catastrophes. Methodology and Computing in Applied Probability, 7, 97–118.
Naor, P. (1969). The regulation of queue size by levying tolls. Econometrica, 37, 15–24.
Serfozo, R., & Stidham, S. (1978). Semi-stationary clearing processes. Stochastic Processes and their Applications, 6, 165–178.
Stidham, S. Jr. (1974). Stochastic clearing systems. Stochastic Processes and their Applications, 2, 85–113.
Stidham, S. Jr. (1977). Cost models for stochastic clearing systems. Operations Research, 25, 100–127.
Stidham, S. Jr. (2009). Optimal design of queueing systems. Boca Raton: CRC Press.
Stirzaker, D. (2006). Processes with catastrophes. The Mathematical Scientist, 31, 107–118.
Stirzaker, D. (2007). Processes with random regulation. Probability in the Engineering and Informational Sciences, 21, 1–17.
Sun, W., Guo, P., & Tian, N. (2010). Equilibrium threshold strategies in observable queueing systems with setup/closedown times. Central European Journal of Operations Research, 18, 241–268.
Yang, W. S., Kim, J. D., & Chae, K. C. (2002). Analysis of M/G/1 stochastic clearing systems. Stochastic Analysis and Applications, 20, 1083–1100.
Zhang, F., & Wang, J. (2010). Equilibrium analysis of the observable queue with balking and delayed repairs. In 3rd international joint conference on computational sciences and optimization, CSO 2010: theoretical development and engineering practice 2, art. no. 5533079 (pp. 125–129).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Economou, A., Manou, A. Equilibrium balking strategies for a clearing queueing system in alternating environment. Ann Oper Res 208, 489–514 (2013). https://doi.org/10.1007/s10479-011-1025-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-011-1025-x