An ɛ-Nash Equilibrium with High Probability for Strategic Customers in Heavy Traffic

Published Online:https://doi.org/10.1287/moor.2016.0820

References

  • Aksin Z, Armony M, Mehrotra V (2007) The modern call center: A multi-disciplinary perspective on operations management research. Production Oper. Management 16(6):665–688.CrossrefGoogle Scholar
  • Allon G, Gurvich I (2010) Pricing and dimensioning competing large-scale service providers. Manufacturing Service Oper. Management 12(3):449–469.LinkGoogle Scholar
  • Anderson R, Orey S (1976) Small random perturbations of dynamical systems with reflecting boundary. Nagoya Math. J. 60:189–216.CrossrefGoogle Scholar
  • Atar R, Saha S (2016) A note on non-existence of diffusion limits for serve-the-longest-queue when the buffers are equal in size. Electron. Commun. Probab. 21(2):article 2.Google Scholar
  • Atar R, Shifrin M (2014) An asymptotic optimality result for the multiclass queue with finite buffers in heavy traffic. Stochastic Systems 4:556–603.LinkGoogle Scholar
  • Atar R, Cidon I, Shifrin M (2014) MDP based optimal pricing for a cloud computing queueing model. Performance Eval. 78:1–6.CrossrefGoogle Scholar
  • Billingsley P (1999) Convergence of Probability Measures, Wiley Series in Probability and Statistics: Probability and Statistics, 2nd ed. (John Wiley & Sons, New York).CrossrefGoogle Scholar
  • Dupuis P, Ishii H (1991) On Lipschitz continuity of the solution mapping to the Skorokhod problem, with applications. Stochastics Stochastics Rep. 35:31–62.CrossrefGoogle Scholar
  • Gopalakrishnan R, Doroudi S, Ward A, Wierman A (2016) Routing and staffing when servers are strategic. Oper. Res. 64(4):1033–1050.LinkGoogle Scholar
  • Guo P, Hassin R (2011) Strategic behavior and social optimization in Markovian vacation queues. Oper. Res. 59(4):986–997.LinkGoogle Scholar
  • Gurvich I, Whitt W (2009) Queue-and-idleness-ratio controls in many-server service systems. Math. Oper. Res. 34(2):363–396.LinkGoogle Scholar
  • Halfin S, Whitt W (1981) Heavy-traffic limits for queues with many exponential servers. Oper. Res. 29(3):567–588.LinkGoogle Scholar
  • Hassin R, Haviv M (2003) To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems, International Series in Operations Research and Management Science, Vol. 59 (Kluwer Academic Publishers, Boston).CrossrefGoogle Scholar
  • Jacod J, Shiryaev AN (1987) Limit Theorems for Stochastic Processes, Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], Vol. 288 (Springer, Berlin).Google Scholar
  • Manou A, Economou A, Karaesmen F (2014) Strategic customers in a transportation station: When is it optimal to wait? Oper. Res. 62(4):910–925.LinkGoogle Scholar
  • Naor P (1969) The regulation of queue size by levying tolls. Econometrica 37(1):15–24.CrossrefGoogle Scholar
  • Reiman MI (1982) The heavy traffic diffusion approximation for sojourn times in Jackson networks. Disney RL, Ott TJ, eds. Applied Probability—Computer Science: The Interface. Progress in Computer Science, Vol. 3 (Birkhäuser, Boston), 409–421.CrossrefGoogle Scholar
  • Zhan D, Ward A (2015) Incentive based service system design: Staffing and compensation to trade off speed and quality. SSRN: https://ssrn.com/abstract=2568007.Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.