Self-Interested Routing in Queueing Networks

References

• Adiri I., Yechiali U. Optimal priority purchasing and pricing decisions in nonmonopoly and monopoly queues. Oper. Res. (1974) 22:1051–1066Link, Google Scholar
• Altman E., Shimkin N. Individual equilibrium and learning in processor sharing systems. Oper. Res. (1998) 46:776–784Link, Google Scholar
• Armony M., Maglaras C. On customer contact centers with a callback option: Customer decision, sequencing rules, and system design. Oper. Res. (2004) 52(2):271–292Link, Google Scholar
• Beckmann M., McGuire C. B., Winsten C. B.Studies in the Economics of Transportation (1956) (Yale University Press, New Haven, CT) Google Scholar
• Bell C. E., Stidham S. Individual versus social optimization in the allocation of customers to alternative servers. Management Sci. (1983) 29:831–839Link, Google Scholar
• Braess D. Über ein paradoxon der verkehrsplanung. Unternehmensforschung (1968) 12:258–268Google Scholar
• Cohen J. E., Kelly F. P. A paradox of congestion in a queuing network. J. Appl. Probab. (1990) 27:730–734Crossref, Google Scholar
• Dai J. G. On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models. Ann. Appl. Probab. (1995) 5:49–77Crossref, Google Scholar
• Dai J. G., Prabhakar B. The throughput of data switches with and without speedup. Proc. IEEE INFOCOM 2002 (2000) 2:556–564Crossref, Google Scholar
• Dubey P. Inefficiency of Nash equilibria. Math. Oper. Res. (1986) 11(1):1–8Link, Google Scholar
• Fudenberg D., Tirole J.Game Theory (1991) (MIT Press, Cambridge, MA) Google Scholar
• Harrison J. M., Fleming W., Lions P. L. Brownian models of queueing networks with heterogeneous customer populations. Stochastic Differential Systems, Stochastic Control Theory and Applications (1988) (Springer, New York) 147–186Crossref, Google Scholar
• Harrison J. M., Van Mieghem J. A. Dynamic control of Brownian networks: State-space collapse and equivalent workload formulations. Ann. Appl. Probab. (1997) 7:747–771Crossref, Google Scholar
• Kelly F. P. Network routing. Philos. Trans. Roy. Soc. London A (1991) 337:343–367Crossref, Google Scholar
• Koutsoupias E., Papadimitriou C. Worst-case equilibria. 1563Proc. 16th Annual Sympos. Theoret. Aspects Comput. Sci. Lecture Notes in Computer Science(Springer, Berlin, Germany) 404–413Google Scholar
• Kumar S., Kumar P. R. Performance bounds for queueing networks and scheduling policies. IEEE Trans. Automatic Control (1994) 39(8):1600–1611Crossref, Google Scholar
• Kumar P. R., Seidman T. I. Dynamic instabilities and stabilization methods in distributed real-time scheduling of manufacturing systems. IEEE Trans. Automatic Control (1990) 35:289–298Crossref, Google Scholar
• La R. J., Anantharam V. Optimal routing control: A repeated game approach. IEEE Trans. Automatic Control (2002) 47(3):437–450Crossref, Google Scholar
• Lu C. H., Kumar P. R. Distributed scheduling based on due dates and buffer priorities. IEEE Trans. Automatic Control (1991) 36(12):1406–1416Crossref, Google Scholar
• Maglaras C. Dynamic control of stochastic processing networks: A fluid model approach. (1998) . Ph.D. thesis, Department of Electrical Engineering, Stanford University, Stanford, CAGoogle Scholar
• Maglaras C., Zeevi A. Pricing and capacity sizing for systems with shared resources: Approximate solutions. Management Sci. (2003) 49(8):1018–1038Link, Google Scholar
• Maglaras C., Zeevi A. Pricing and design of differentiated services: Approximate analysis and structural insights. Oper. Res. (2005) . Forthcoming.Link, Google Scholar
• Mendelson H., Whang S. Optimal incentive-compatible priority pricing for the M/M/1 queue. Oper. Res. (1990) 38:870–883Link, Google Scholar
• Naor P. The regulation of queue size by levying tolls. Econometrica (1969) 37:15–24Crossref, Google Scholar
• Panwalker S. S., Iskander W. A survey of scheduling rules. Oper. Res. (1977) 25(1):45–61Link, Google Scholar
• Papadimitriou C. H., Tsitsiklis J. N. The complexity of optimal queueing network control. Math. Oper. Res. (1996) 24(2):293–305Link, Google Scholar
• Pinilla J. M., Prinz F. B. Lead time reduction through flexible routing: Application to shape deposition manufacturing. Internat. J. Production Res. (2003) 41(13):2957–2973Crossref, Google Scholar
• Ridemax.com. 2004. www.ridemax.comGoogle Scholar
• Roughgarden T., Tardos E. How bad is selfish routing? J. ACM (2002) 49(2):236–259Crossref, Google Scholar
• Rybko A. N., Stolyar A. L. Ergodicity of stochastic processes describing the operations of open queueing networks. Problems Inform. Transmission (1992) 28:199–220Google Scholar
• Sharifnia A. Instability of the join-the-shortest-queue and FCFS policies in queuing systems and their stabilization. Oper. Res. (1997) 45(2):309–314Link, Google Scholar
• Van Mieghem J. V. Price and service discrimination in queuing systems: Incentive compatibility of Gcμ scheduling. Management Sci. (2000) 46(9):1249–1267Link, Google Scholar
• Whitt W. Deciding which queue to join: Some counterexamples. Oper. Res. (1986) 34(1):55–62Link, Google Scholar
• Whitt W. How multiserver queues scale with growing congestion dependent demand. Oper. Res. (2003) 51(4):531–542Link, Google Scholar