Congestion Games with Variable Demands

References

• 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
• Anshelevich E, Dasgupta A, Kleinberg J, Tardos É, Wexler T, Roughgarden T (2008) The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4):1602–1623.Crossref, Google Scholar
• Beckmann M, McGuire C, Winsten C (1956) Studies in the Economics and Transportation (Yale University Press, New Haven, CT).Google Scholar
• Bilò V (2007) On satisfiability games and the power of congestion games. Kao M-Y, Li X-Y, eds. Algorithmic Aspects in Information and Management, Lecture Notes in Computer Science, Vol. 4508 (Springer, Berlin), 231–240.Crossref, Google Scholar
• Chen H, Roughgarden T (2009) Network design with weighted players. Theory Comput. Syst. 45(2):302–324.Crossref, Google Scholar
• Cole R, Dodis Y, Roughgarden T (2006) Bottleneck links, variable demand, and the tragedy of the commons. Proc. 17th Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 668–677.Crossref, Google Scholar
• Even-Dar E, Kesselman A, Mansour Y (2007) Convergence time to Nash equilibrium in load balancing. ACM Trans. Algorithms 3(3):1–21.Crossref, Google Scholar
• Fotakis D, Kontogiannis S, Spirakis P (2005) Selfish unsplittable flows. Theoret. Comput. Sci. 348(2–3):226–239.Crossref, Google Scholar
• Gairing M, Klimm M (2013) Congestion games with player-specific costs revisited. Vöcking B, ed. Algorithmic Game Theory, Lecture Notes in Computer Science, Vol. 8146 (Springer, Berlin), 98–109.Crossref, Google Scholar
• Gairing M, Monien B, Tiemann K (2011) Routing (un-)splittable flow in games with player-specific linear latency functions. ACM Trans. Algorithms 7(3):1–31.Crossref, Google Scholar
• Georgiou C, Pavlides T, Philippou A (2009) Selfish routing in the presence of network uncertainty. Parallel Process. Lett. 19(1):141–157.Crossref, Google Scholar
• Ghomi M (2002) The problem of optimal smoothing for convex functions. Proc. Amer. Math. Soc. 130(8):2255–2259.Crossref, Google Scholar
• Glicksberg I (1952) A further generalization of the Kakutani fixed point theorem, with application to Nash equilibrium points. Proc. Amer. Math. Soc. 3:170–174.Google Scholar
• Goemans M, Mirrokni V, Vetta A (2005) Sink equilibria and convergence. Proc. 46th Annual IEEE Sympos. Foundations Comput. Sci. (IEEE Computer Society, Washington, DC), 142–154.Crossref, Google Scholar
• Harks T, Klimm M (2011) Congestion games with variable demands. Apt K, ed. Proc. 13th Conf. Theoret. Aspects of Rationality and Knowledge (ACM, New York), 111–120.Crossref, Google Scholar
• Harks T, Klimm M (2012) On the existence of pure Nash equilibria in weighted congestion games. Math. Oper. Res. 37(3):419–436.Link, Google Scholar
• Harks T, Klimm M, Möhring R (2011) Characterizing the existence of potential functions in weighted congestion games. Theory Comput. Syst. 49(1):46–70.Crossref, Google Scholar
• Haurie A, Marcotte P (1985) On the relationship between Nash-Cournot and Wardrop equilibria. Networks 15:295–308.Crossref, Google Scholar
• Holzman R, Law-Yone N (1997) Strong equilibrium in congestion games. Games Econom. Behav. 21(1–2):85–101.Crossref, Google Scholar
• Ieong S, McGrew R, Nudelman E, Shoham Y, Sun Q (2005) Fast and compact: A simple class of congestion games. Proc. 20th Natl. Conf. Artificial Intelligence and the 17th Innovative Appl. Artificial Intelligence Conf. (AAAI Press, Menlo Park, CA), 489–494.Google Scholar
• Johari R, Tsitsiklis JN (2006) A scalable network resource allocation mechanism with bounded efficiency loss. IEEE J. Sel. Area Commun. 24(5):992–999.Crossref, Google Scholar
• Kelly F, Maulloo A, Tan D (1998) Rate control in communication networks: Shadow prices, proportional fairness, and stability. J. Oper. Res. Soc. 49:237–252.Crossref, Google Scholar
• Klimm M (2012) Competition for resources: The equilibrium existence problem in congestion games. Ph.D. thesis, Technische Universität Berlin, Berlin.Google Scholar
• Libman L, Orda A (2001) Atomic resource sharing in noncooperative networks. Telecommun. Syst. 17(4):385–409.Crossref, Google Scholar
• Low S, Lapsley D (1999) Optimization flow control I: Basic algorithm and convergence. IEEE/ACM Trans. Networking 7:861–874.Crossref, Google Scholar
• Milchtaich I (1996) Congestion games with player-specific payoff functions. Games Econom. Behav. 13(1):111–124.Crossref, Google Scholar
• Milchtaich I (2006) The equilibrium existence problem in finite network congestion games. Spirakis P, Mavronicolas M, Kontogiannis S, eds. Internet and Network Economics, Lecture Notes in Computer Science, Vol. 4286 (Springer, Berlin), 87–98.Crossref, Google Scholar
• Milchtaich I (2011) Representation of finite games as network congestion games. Proc. 5th Internat. Conf. Network Games, Control and Optim. (IEEE, Piscataway, NJ), 1–5.Google Scholar
• Monderer D (2007) Multipotential games. Sangal R, Mehta H, Bagga RK, eds.Proc. 20nd Internat. Joint Conf. Artificial Intelligence (Morgan Kaufmann, San Francisco), 1422–1427.Google Scholar
• Orda A, Rom R, Shimkin N (1993) Competitive routing in multi-user communication networks. IEEE/ACM Trans. Networking 1:510–521.Crossref, Google Scholar
• Panagopoulou P, Spirakis P (2006) Algorithms for pure Nash equilibria in weighted congestion games. ACM J. Exp. Algorithmics 11:1–19.Google Scholar
• Rosen J (1965) Existence and uniqueness of equilibrium points in concave n-player games. Econometrica 33(3):520–534.Crossref, Google Scholar
• Rosenthal R (1973) A class of games possessing pure-strategy Nash equilibria. Internat. J. Game Theory 2(1):65–67.Crossref, Google Scholar
• Rosenthal R (1973) The network equilibrium problem in integers. Networks 3:53–59.Crossref, Google Scholar
• Roughgarden T (2005) Selfish Routing and the Price of Anarchy (MIT Press, Cambridge, MA).Google Scholar
• Shenker S (1995) Fundamental design issues for the future internet. IEEE J. Sel. Area Commun. 13:1176–1188.Crossref, Google Scholar
• Smith M (1979) The marginal cost taxation of a transportation network. Transportation Res. Part B: Methodological 13(3):237–242.Crossref, Google Scholar
• Srikant R (2003) The Mathematics of Internet Congestion Control (Birkhäuser, Basel, Switzerland).Google Scholar
• Tran-Thanh L, Polukarov M, Chapman A, Rogers A, Jennings N (2011) On the existence of pure strategy Nash equilibria in integer-splittable weighted congestion games. Persiano G, ed. Algorithmic Game Theory. Lecture Notes in Computer Science, Vol. 6982 (Springer, Berlin), 236–253.Crossref, Google Scholar
• Wardrop JG (1952) Some theoretical aspects of road traffic research. Proc. Inst. Civil Engineers 1(Part II):325–362.Crossref, Google Scholar
• Webster R (1994) Convexity (Oxford University Press, Oxford, UK).Google Scholar