Abstract
In this survey we present some recent advances in the literature of atomic (mainly network) congestion games. The algorithmic questions that we are interested in have to do with the existence of pure Nash equilibria, the efficiency of their construction when they exist, as well as the gap of the best/worst (mixed in general) Nash equilibria from the social optima in such games, typically called the Price of Anarchy and the Price of Stability respectively.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This work is partially supported by the EU within 6th FP under contract 001907 (DELIS).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Proc. of the 45th IEEE Symp. on Foundations of Computer Science (FOCS 2004), pp. 295–304 (2004)
Anshelevich, E., Dasgupta, A., Tardos, E., Wexler, T.: Near-optimal network design with selfish agents. In: Proc. of the 35th ACM Symp. on Theory of Computing (STOC 2003), pp. 511–520 (2004)
Awerbuch, B., Azar, Y., Epstein, A.: The price of routing unsplittable flow. In: Proc. of the 37th ACM Symp. on Theory of Computing (STOC 2005), pp. 57–66 (2005)
Christodoulou, G., Koutsoupias, E.: The Price of Anarchy of Finite Congestion Games. In: Proc. of the 37th ACM Symp. on Theory of Computing (STOC 2005), pp. 67–73 (2005)
Czumaj, A., Krysta, P., Voecking, B.: Selfish traffic allocation for server farms. In: Proc. of the 34th ACM Symp. on Theory of Computing (STOC 2002), pp. 287–296 (2002)
Czumaj, A., Voecking, B.: Tight bounds for worst-case equilibria. In: Proc. of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 413–420 (2002)
Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence time to nash equilibria. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 502–513. Springer, Heidelberg (2003)
Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure nash equilibria. In: Proc. of the 36th ACM Symp. on Theory of Computing, STOC 2004 (2004)
Feldmann, R., Gairing, M., Luecking, T., Monien, B., Rode, M.: Nashification and the coordination ratio for a selfish routing game. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 514–526. Springer, Heidelberg (2003)
Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., Spirakis, P.: The structure and complexity of nash equilibria for a selfish routing game. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 123–134. Springer, Heidelberg (2002)
Fotakis, D., Kontogiannis, S., Spirakis, P.: Selfish unsplittable flows. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 593–605. Springer, Heidelberg (2004)
Fotakis, D., Kontogiannis, S., Spirakis, P.: Symmetry in network congestion games: Pure equilibria and anarchy cost. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol. 3879, pp. 161–175. Springer, Heidelberg (2006)
Gairing, M., Luecking, T., Mavronicolas, M., Monien, B., Spirakis, P.: Extreme nash equilibria. In: Blundo, C., Laneve, C. (eds.) ICTCS 2003. LNCS, vol. 2841, pp. 1–20. Springer, Heidelberg (2003)
Hochbaum, D., Shmoys, D.: A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM J. Comput. 17(3), 539–551 (1988)
Johari, R., Tsitsiklis, J.: Efficiency loss in a network resource allocation game. To appear in the Mathematics of Operations Research (2004)
Johnson, D., Papadimitriou, C., Yannakakis, M.: How easy is local search? J. of Computer and System Sciences 37, 79–100 (1988)
Koutsoupias, E., Mavronicolas, M., Spirakis, P.: Approximate equilibria and ball fusion. ACM Transactions on Computer Systems 36, 683–693 (2003)
Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404–413. Springer, Heidelberg (1999)
Libman, L., Orda, A.: Atomic resource sharing in noncooperative networks. Telecommunication Systems 17(4), 385–409 (2001)
Lücking, T., Mavronicolas, M., Monien, B., Rode, M.: A new model for selfish routing. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 547–558. Springer, Heidelberg (2004)
Lücking, T., Mavronicolas, M., Monien, B., Rode, M., Spirakis, P., Vrto, I.: Which is the worst-case nash equilibrium? In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 551–561. Springer, Heidelberg (2003)
Mavronicolas, M., Spirakis, P.: The price of selfish routing. In: Proc. of the 33rd ACM Symp. on Theory of Computing (STOC 2001), pp. 510–519 (2001)
Milchtaich, I.: Congestion games with player-specific payoff functions. Games and Economic Behavior 13, 111–124 (1996)
Monderer, D., Shapley, L.: Potential games. Games and Economic Behavior 14, 124–143 (1996)
Rosenthal, R.W.: A class of games possessing pure-strategy nash equilibria. International Journal of Game Theory 2, 65–67 (1973)
Roughdarden, T., Tardos, E.: How bad is selfish routing? J. Assoc. Comput. Mach. 49(2), 236–259 (2002)
Roughgarden, T.: The price of anarchy is independent of the network topology. In: Proc. of the 34th ACM Symp. on Theory of Computing (STOC 2002), pp. 428–437 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kontogiannis, S., Spirakis, P. (2005). Atomic Selfish Routing in Networks: A Survey. In: Deng, X., Ye, Y. (eds) Internet and Network Economics. WINE 2005. Lecture Notes in Computer Science, vol 3828. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11600930_100
Download citation
DOI: https://doi.org/10.1007/11600930_100
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30900-0
Online ISBN: 978-3-540-32293-1
eBook Packages: Computer ScienceComputer Science (R0)