Price of Anarchy in Networks with Heterogeneous Latency Functions

References

• [1] Ackermann H, Röglin H, Vöcking B (2009) Pure Nash equilibria in player-specific and weighted congestion games. Theoret. Comput. Sci. 410(17):1552–1563.Crossref, Google Scholar
• [2] Aland S, Dumrauf D, Gairing M, Monien B, Schoppmann F (2011) Exact price of anarchy for polynomial congestion games. SIAM J. Comput. 40(5):1211–1233.Crossref, Google Scholar
• [3] Awerbuch B, Azar Y, Epstein A (2013) The price of routing unsplittable flow. SIAM J. Comput. 42(1):160–177.Crossref, Google Scholar
• [4] Cobham A (1954) Priority assignment in waiting line problems. Oper. Res. 2(1):70–76.Google Scholar
• [5] Correa JR, Schulz AS, Stier-Moses NE (2007) Fast, fair, and efficient flows in networks. Oper. Res. 55(2):215–225.Link, Google Scholar
• [6] Correa JR, Schulz AS, Stier-Moses NE (2008) A geometric approach to the price of anarchy in non-atomic congestion games. Games Econom. Behav. 64(2):457–469.Crossref, Google Scholar
• [7] Dafermos SC (1971) An extended traffic assignment model with applications to two-way traffic. Transportation Sci. 5(4):366–389.Link, Google Scholar
• [8] Dafermos SC (1972) Traffic assignment problem for multiclass-user transportation networks. Transportation Sci. 6(1):73–87.Link, Google Scholar
• [9] Dafermos SC (1980) Traffic equilibrium and variational inequalities. Transportation Sci. 14(1):42–54.Link, Google Scholar
• [10] Dafermos SC, Sparrow FT (1969) The traffic assignment problem for a general network. J. Res. Natl. Bureau Standards B, Math. Sci. 73B(2):91–118.Crossref, Google Scholar
• [11] Dubey P (1986) Inefficiency of Nash equilibria. Math. Oper. Res. 11(1):1–8.Link, Google Scholar
• [12] Kapoor S, Shin J (2018) Price of anarchy with heterogeneous latency functions. Working paper, Illinois Institute of Technology, Chicago.Google Scholar
• [13] Koutsoupias E, Papadimitriou C (1999) Worst-case equilibria. Meinel C, Tison S, eds. Proc. 16th Annual Conf. Theoret. Aspects Comput. Sci. (Springer-Verlag, Berlin), 404–413.Google Scholar
• [14] Lin H, Roughgarden T, Tardos E, Walkover A (2011) Stronger bounds on Braess’s paradox and the maximum latency of selfish routing. SIAM J. Discrete Math. 25(4):1667–1686.Crossref, Google Scholar
• [15] Milchtaich I (1996) Congestion games with player-specific payoff functions. Games Econom. Behav. 13(1):111–124.Crossref, Google Scholar
• [16] Monderer D, Shapley LS (1996) Potential games. Games Econom. Behav. 14(1):124–143.Crossref, Google Scholar
• [17] Nagurney A (2000) A multiclass, multicriteria traffic network equilibrium model. Math. Comput. Model. 32(3–4):393–411.Crossref, Google Scholar
• [18] Odlyzko A (1999) Paris metro pricing for the Internet. Proc. First ACM Conf. Electronic Commerce (Association for Computing Machinery, New York), 140–147.Google Scholar
• [19] Papadimitriou C, Valiant G (2010) A new look at selfish routing. Innovations Comput. Sci. 2010, Beijing, China, 178–187.Google Scholar
• [20] Peha JM, Lehr W, Wilkie S (2007) The state of the debate on network neutrality. Internat. J. Comm. 1(1):709–716.Google Scholar
• [21] Pigou AC (1920) The Economics of Welfare (Macmillan, London).Google Scholar
• [22] Potts RB, Oliver RM (1972) Flows in Transportation Networks (Academic Press, Cambridge, MA).Google Scholar
• [23] Rosenthal RW (1973) A class of games possessing pure-strategy Nash equilibria. Internat. J. Game Theory 2(1):65–67.Crossref, Google Scholar
• [24] Roughgarden T (2003) The price of anarchy is independent of the network topology. J. Comput. System Sci. 67(2):341–364.Crossref, Google Scholar
• [25] Roughgarden T (2004) The maximum latency of selfish routing. Proc. 15th Annual ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 980–981.Google Scholar
• [26] Roughgarden T (2005) Selfish routing with atomic players. Proc.16th Annual ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 1184–1185.Google Scholar
• [27] Roughgarden T, Tardos E (2002) How bad is selfish routing? J. ACM 49(2):236–259.Crossref, Google Scholar
• [28] Wardrop JG (1952) Some theoretical aspects of road traffic research. Proc. Institution Civil Engineers, Part II 1(36):352–362.Google Scholar
• [29] Weitz D (2001) The price of anarchy. Unpublished manuscript.Google Scholar