Strategic Open Routing in Service Networks

References

• Adiri I, Yechiali U (1974) Optimal priority-purchasing and pricing decisions in nonmonopoly and monopoly queues. Oper. Res. 22(5):1051–1066.Link, Google Scholar
• Afèche P, Mendelson H (2004) Pricing and priority auctions in queueing systems with a generalized delay cost structure. Management Sci. 50(7):869–882.Link, Google Scholar
• Baron O, Berman O, Krass D, Wang J (2016) Strategic idleness and dynamic scheduling in an open-shop service network: Case study and analysis. Manufacturing Service Oper. Management 19(1):52–71.Link, Google Scholar
• Braess D (1968) Über ein paradoxon aus der verkehrsplanung. Unternehmensforschung 12(1):258–268.Google Scholar
• Brown GW (1951) Iterative solution of games by fictitious play. Activity Anal. Production and Allocation 13(1):374–376.Google Scholar
• Cohen JE, Kelly FP (1990) A paradox of congestion in a queuing network. J. Appl. Probab. 27(3):730–734.Crossref, Google Scholar
• Cui S, Veeraraghavan S (2016) Blind queues: The impact of consumer beliefs on revenues and congestion. Management Sci. 62(12):3656–3672.Link, Google Scholar
• Debo L, Veeraraghavan S (2014) Equilibrium in queues under unknown service times and service value. Oper. Res. 62(1):38–57.Link, Google Scholar
• Enders P, Gandhi A, Gupta V, Debo L, Harchol-Balter M, Scheller-Wolf A (2008) Inducing optimal scheduling with selfish users. Working paper, Carnegie Mellon University, Pittsburgh.Google Scholar
• Feldman M, Tamir T (2012) Conflicting congestion effects in resource allocation games. Oper. Res. 60(3):529–540.Link, Google Scholar
• Fudenberg D, Levine DK (1998) The Theory of Learning in Games (MIT Press, Cambridge, MA).Google Scholar
• Glazer A, Hassin R (1983) M/M/1: On the equilibrium distribution of customer arrivals. Eur. J. Oper. Res. 13(2):146–150.Crossref, Google Scholar
• Grimmett G, Stirzaker D (2001) Probability and Random Processes (Oxford University Press, Oxford, UK).Crossref, Google Scholar
• Hassin R (2016) Rational Queueing (CRC Press, New York).Crossref, Google Scholar
• Hassin R, Haviv M (2003) To Queue or Not to Queue: Equilibrium Behavior in Queueing Systems, Vol. 59 (Springer Science & Business Media, New York).Crossref, Google Scholar
• Honnappa H, Jain R (2015) Strategic arrivals into queueing networks: The network concert queueing game. Oper. Res. 63(1):247–259.Link, Google Scholar
• Kelly FP (1979) Reversibility and Stochastic Networks (Wiley, New York).Google Scholar
• Kingman J (1962) Some inequalities for the queue GI/G/1. Biometrika 49(3–4):315–324.Crossref, Google Scholar
• Koutsoupias E, Papadimitriou C (2009) Worst-case equilibria. Comput. Sci. Rev. 3(2):65–69.Crossref, Google Scholar
• Leshno JD (2017) Dynamic matching in overloaded waiting lists. Working paper, Columbia University, New York.Crossref, Google Scholar
• Milgrom P, Roberts J (1990) Rationalizability, learning, and equilibrium in games with strategic complementarities. Econometrica: J. Econometric Soc. 58(6):1255–1277.Crossref, Google Scholar
• Müller A, Stoyan D (2002) Comparison Methods for Stochastic Models and Risks, Vol. 389 (John Wiley & Sons, Hoboken, NJ).Google Scholar
• Naor P (1969) The regulation of queue size by levying tolls. Econometrica: J. Econometric Soc. 37(1):15–24.Crossref, Google Scholar
• Parlaktürk AK, Kumar S (2004) Self-interested routing in queueing networks. Management Sci. 50(7):949–966.Link, Google Scholar
• Pinedo ML (2012) Scheduling: Theory, Algorithms, and Systems (Springer Science & Business Media, New York).Crossref, Google Scholar
• Pinilla JM, Prinz FB (2003) Lead-time reduction through flexible routing: Application to shape deposition manufacturing. Internat. J. Production Res. 41(13):2957–2973.Crossref, Google Scholar
• Roughgarden T, Tardos É (2002) How bad is selfish routing? J. ACM 49(2):236–259.Crossref, Google Scholar
• Schummer J (2017) Influencing waiting lists. Working paper, Kellogg School of Management, Evanston, IL.Google Scholar
• Su X, Zenios S (2004) Patient choice in kidney allocation: The role of the queueing discipline. Manufacturing Service Oper. Management 6(4):280–301.Link, Google Scholar
• Topkis D (1998) Supermodularity and Complementarity (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• Veeraraghavan S, Debo L (2009) Joining longer queues: Information externalities in queue choice. Manufacturing Service Oper. Management 11(4):543–562.Link, Google Scholar
• Veeraraghavan SK, Debo LG (2011) Herding in queues with waiting costs: Rationality and regret. Manufacturing Service Oper. Management 13(3):329–346.Link, Google Scholar