Article ID: | iaor20133614 |
Volume: | 230 |
Issue: | 1 |
Start Page Number: | 76 |
End Page Number: | 87 |
Publication Date: | Oct 2013 |
Journal: | European Journal of Operational Research |
Authors: | Zhang Feng, Wang Jinting |
Keywords: | M/M/1 queues, retrial queues, balking, Nash equilibrium |
The equilibrium and socially optimal balking strategies are investigated for unobservable and observable single‐server classical retrial queues. There is no waiting space in front of the server. If an arriving customer finds the server idle, he occupies the server immediately and leaves the system after service. Otherwise, if the server is found busy, the customer decides whether or not to enter a retrial pool with infinite capacity and becomes a repeated customer, based on observation of the system and the reward–cost structure imposed on the system. Accordingly, two cases with respect to different levels of information are studied and the corresponding Nash equilibrium and social optimization balking strategies for all customers are derived. Finally, we compare the equilibrium and optimal behavior regarding these two information levels through numerical examples.