Stackelberg Routing in Arbitrary Networks

References

• Babaioff M., Kleinberg R., Papadimitriou C. H. Congestion games with malicious players. Proc. 8th ACM Conf. Electronic Commerce (2007) (ACM, New York) 103–112Crossref, Google Scholar
• Beckmann M., McGuire C. B., Winsten C. B.Studies in the Economics and Transportation (1956) (Yale University Press, New Haven, CT) Google Scholar
• Braess D. Über ein Paradoxon der Verkehrsplanung. Unternehmenforschung (1968) 11:258–268Google Scholar
• Chen P.-A., Kempe D. Altruism, selfishness, and spite in traffic routing. Proc. 9th ACM Conf. Electronic Commerce (2008) (ACM, New York) 140–149Crossref, Google Scholar
• Cole R., Dodis Y., Roughgarden T. Pricing network edges for heterogeneous selfish users. Proc. 35th ACM Sympos. Theory Comput. (2003) (ACM, New York) 521–530Crossref, Google Scholar
• Correa J. R., Stier-Moses N. E. Stackelberg routing in atomic network games. (2007) . Technical Report DRO-2007-03, Columbia Business School, New YorkGoogle Scholar
• Correa J. R., Schulz A. S., Stier-Moses N. E. Selfish routing in capacitated networks. Math. Oper. Res. (2004) 29:961–976Link, Google Scholar
• Correa J. R., Schulz A. S., Stier-Moses N. E. On the inefficiency of equilibria in congestion games. Proc. 11th Internat. Conf. Integer Programming Combin. Optim. (2005) (Springer, Berlin) 167–181Crossref, Google Scholar
• Correa J. R., Schulz A. S., Stier-Moses N. E. Fast, fair, and efficient flows in networks. Oper. Res. (2007) 55(2):215–225Link, Google Scholar
• Dubey P. Inefficiency of Nash equilibria. Math. Oper. Res. (1986) 11:1–8Link, Google Scholar
• Fleischer L. K., Jain K., Mahdian M. Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games. Proc. 45th IEEE Sympos. Foundations Comput. Sci. (2004) (IEEE, Washington, DC) 277–285Crossref, Google Scholar
• Fotakis D. Stackelberg strategies for atomic congestion games. Proc. 15th Eur. Sympos. Algorithms (2007) 4698(Springer, Berlin) 299–310Lecture Notes in Computer ScienceCrossref, Google Scholar
• Gallo G., Sandi C., Sodini C. An algorithm for the min concave cost flow problem. Eur. J. Oper. Res. (1980) 4(4):248–255Crossref, Google Scholar
• Harks T. Stackelberg strategies and collusion in network games with splittable flow. Proc. 6th Workshop Approximation Online Algorithms (2008) (Springer, Berlin) 133–146Google Scholar
• Hearn D. W., Ramana M. V., Marcotte P., Nguyen S. Solving congestion toll pricing models. Equilibrium and Advanced Transportation Modelling (1998) (Springer, Berlin) 109–124Crossref, Google Scholar
• Kaporis A. C., Spirakis P. G. The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions. Proc. 18th ACM Sympos. Parallelism Algorithms Architectures (2006) (ACM, New York) 19–28Crossref, Google Scholar
• Karakostas G., Kolliopoulos S. G. Edge pricing of multicommodity networks for heterogeneous selfish users. Proc. 45th IEEE Sympos. Foundations Comput. Sci. (2004) (IEEE, Washington, DC) 268–276Crossref, Google Scholar
• Karakostas G., Kolliopoulos S. G. Stackelberg strategies for selfish routing in general multicommodity networks. Algorithmica (2009) 53(1):132–153Crossref, Google Scholar
• Knight F. H. Some fallacies in the interpretation of social cost. Quart. J. Econom. (1924) 38(4):582–606Crossref, Google Scholar
• Knuth D. E.The Art of Computer Programming (1997) (Addison-Wesley, Reading, MA) Google Scholar
• Korilis Y. A., Lazar A. A., Orda A. Achieving network optima using Stackelberg routing strategies. IEEE/ACM Trans. Networking (1997) 5(1):161–173Crossref, Google Scholar
• Koutsoupias E., Papadimitriou C. H., Meines C., Tison S. Worst-case equilibria. Proc. 16th Sympos. Theoret. Aspects Comput. Sci. (1999) (Springer, Berlin) 404–413Crossref, Google Scholar
• Kumar V. S. A., Marathe M. V. Improved results for Stackelberg scheduling strategies. Proc. 33rd Internat. Colloquium Automata, Languages Programming (2002) (Springer, Berlin) 776–787Crossref, Google Scholar
• Lin H., Roughgarden T., Tardos É., Walkover A. Braess's paradox, Fibonacci numbers, and exponential inapproximability. Proc. 32nd Internat. Colloquium Automata, Languages Programming (2005) (Springer, Berlin) 497–512Crossref, Google Scholar
• Perakis G. The “price of anarchy” under nonlinear and asymmetric costs. Math. Oper. Res. (2007) 32(3):614–628Link, Google Scholar
• Roughgarden T. Selfish routing. (2002) . Ph.D. thesis, Cornell University, Ithaca, NYGoogle Scholar
• Roughgarden T. The price of anarchy is independent of the network topology. J. Comput. System Sci. (2003) 67(2):341–364Crossref, Google Scholar
• Roughgarden T. Stackelberg scheduling strategies. SIAM J. Comput. (2004) 33(2):332–350Crossref, Google Scholar
• Roughgarden T. The maximum latency of selfish routing. Proc. 15th ACM-SIAM Sympos. Discrete Algorithms (2004) (SIAM, Philadelphia) 980–981Google Scholar
• Roughgarden T.Selfish Routing and the Price of Anarchy (2005) (The MIT Press, Cambridge, MA) Google Scholar
• Roughgarden T. On the severity of Braess's paradox: Designing networks for selfish users is hard. J. Comput. System Sci. (2006) 72(5):922–953Crossref, Google Scholar
• Roughgarden T., Tardos É. How bad is selfish routing? J. ACM (2002) 49(2):236–259Crossref, Google Scholar
• Sharma Y., Williamson D. Stackelberg thresholds in network routing games or the value of altruism. Proc. 8th ACM Conf. Electronic Commerce (2007) (ACM, New York) 93–102Crossref, Google Scholar
• Smith M. J. The existence, uniqueness and stability of traffic equilibria. Transportation Res. (1979a) 13(4):295–304Crossref, Google Scholar
• Smith M. J. The marginal cost taxation of a transportation network. Transportation Res. Part B: Methodological (1979b) 13(3):237–242Crossref, Google Scholar
• Swamy C. The effectiveness of Stackelberg strategies and tolls for network congestion games. Proc. 18th ACM-SIAM Sympos. Discrete Algorithms (2007) (SIAM, Philadelphia) 1133–1142Google Scholar
• Wardrop J. G. Some theoretical aspects of road traffic research. Proc. Inst. Civil Engineers (1952) 1(Part II):325–378Crossref, Google Scholar
• Yang H., Huang H.-J. The multi-class, multi-criteria traffic network equilibrium and systems optimum problem. Transportation Res. Part B: Methodological (2004) 38(1):1–15Crossref, Google Scholar