Skip to main content
SpringerLink
Log in

Atomic Congestion Games: Fast, Myopic and Concurrent

  • Conference paper
Algorithmic Game Theory (SAGT 2008)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4997))

Included in the following conference series:

Abstract

We study here the effect of concurrent greedy moves of players in atomic congestion games where n selfish agents (players) wish to select a resource each (out of m resources) so that her selfish delay there is not much. The problem of “maintaining” global progress while allowing concurrent play is exactly what is examined and answered here. We examine two orthogonal settings : (i) A game where the players decide their moves without global information, each acting “freely” by sampling resources randomly and locally deciding to migrate (if the new resource is better) via a random experiment. Here, the resources can have quite arbitrary latency that is load dependent. (ii) An “organised” setting where the players are pre-partitioned into selfish groups (coalitions) and where each coalition does an improving coalitional move. Our work considers concurrent selfish play for arbitrary latencies for the first time. Also, this is the first time where fast coalitional convergence to an approximate equilibrium is shown.

The 2nd and 3rd author were partially supported by the IST Program of the European Union under contract number IST-015964 (AEOLUS). This work was partially supported by the Future and Emerging Technologies Unit of EC (IST priority – 6th FP), under contract no. FP6-021235-2 (project ARRIVAL).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ackermann, H., Roeglin, H., Voecking, B.: On the impact of combinatorial structure on congestion games. In: FOCS (2006)

    Google Scholar 

  2. Arndt, H.: Load balancing: dimension exchange on product graphs. In: 18th International Symposium on Parallel and Distributed Processing (2004)

    Google Scholar 

  3. Awerbuch, B., Azar, Y., Epstein, A.: The Price of Routing Unsplittable Flow. In: STOC (2005)

    Google Scholar 

  4. Berenbrink, P., Friedetzky, T., Goldberg, L.A., Goldberg, P., Hu, Z., Martin, R.: Distributed selfish load balancing. In: SODA (2006)

    Google Scholar 

  5. Blum, A., Even-Dar, E., Ligett, K.: Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing games. In: PODC (2006)

    Google Scholar 

  6. Chien, S., Sinclair, A.: Convergece to Approximate Nash Equilibria in Congestion Games. In: SODA (2007)

    Google Scholar 

  7. Christodoulou, G., Koutsoupias, E.: The Price of Anarchy of Finite Congestion Games. In: STOC (2005)

    Google Scholar 

  8. Christodoulou, G., Mirrokni, V.S., Sidiropoulos, A.: Convergence and approximation in potential games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 349–360. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Cybenko, G.: Load balancing for distributed memory multiprocessors. J. Parallel Distrib. Comput. 7, 279–301 (1989)

    Article  Google Scholar 

  10. Even-Dar, E., Mansour, Y.: Fast convergence of selfish rerouting. In: SODA (2005)

    Google Scholar 

  11. 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)

    Chapter  Google Scholar 

  12. Fabrikant, A., Papadimitriou, C., Talwar, K.: The Complexity of Pure Nash Equilibria. In: STOC (2004)

    Google Scholar 

  13. Fischer, S., Räcke, H., Vöcking, B.: Fast convergence to wardrop equilibria by adaptive sampling methods. In: STOC (2006)

    Google Scholar 

  14. Fotakis, D., Kontogiannis, S., Spirakis, P.: Selfish Unsplittable Flows. In: TCS, vol. 348, pp. 226–239 (2005)

    Google Scholar 

  15. Fotakis, D., Kontogiannis, S., Spirakis, P.: Atomic Congestion Games among Coalitions. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 572–583. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  16. Ghosh, B., Muthukrishnan, S.: Dynamic load balancing in parallel and distributed networks by random matchings. In: SPAA (1994)

    Google Scholar 

  17. Goemans, M.X., Mirrokni, V.S., Vetta, A.: Sink equilibria and convergence. In: FOCS 2005 (2005)

    Google Scholar 

  18. Goldberg, P.W.: Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game. In: PODC (2004)

    Google Scholar 

  19. Hayrapetyan, A., Tardos, É., Wexler, T.: The Effect of Collusion in Congestion Games. In: STOC (2006)

    Google Scholar 

  20. Hosseini, S.H., Litow, B., Malkawi, M.I., McPherson, J., Vairavan, K.: Analysis of a graph coloring based distributed load balancing algorithm.. J. Par. Distr. Comp. 10, 160–166 (1990)

    Article  Google Scholar 

  21. Ieong, S., McGrew, R., Nudelman, E., Shoham, Y., Sun, Q.: Fast and compact: A simple class of congestion games. In: AAAI (2005)

    Google Scholar 

  22. Libman, L., Orda, A.: Atomic resource sharing in noncooperative networks. Telecommunication Systems 17(4), 385–409 (2001)

    Article  Google Scholar 

  23. Mirrokni, V., Vetta, A.: Convergence Issues in Competitive Games. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol. 3122, pp. 183–194. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  24. Monderer, D., Shapley, L.: Potential Games. Games& Econ. Behavior 14, 124–143 (1996)

    Article  MathSciNet  Google Scholar 

  25. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)

    Book  Google Scholar 

  26. Orda, A., Rom, R., Shimkin, N.: Competitive routing in multiuser communication networks. IEEE/ACM Trans. on Net. 1(5), 510–521 (1993)

    Article  Google Scholar 

  27. Rosenthal, R.W.: A Class of Games Possessing Pure-Strategy Nash Equilibria. International Journal of Game Theory 2, 65–67 (1973)

    Article  MathSciNet  Google Scholar 

  28. Sandholm, W.H.: Population Games and Evolutionary Dynamics. MIT Press (to be published), http://www.ssc.wisc.edu/~whs/book/index.html

  29. Sandholm, W.H.: Potential Games with Continuous Player Sets. Journal of Economic Theory 97, 81–108 (2001)

    Article  MathSciNet  Google Scholar 

  30. Extended version. http://students.ceid.upatras.gr/~kaporis/papers/fks-sagt-08.pdf

  31. Weibull, J.W.: Evolutionary Game Theory. MIT Press, Cambridge (1995)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Eng. and Informatics, Univ of Patras, 26500, Patras, Greece

    Alexis C. Kaporis & Paul G. Spirakis

  2. Research Academic Comp. Tech. Inst., N. Kazantzaki Str, 26500, Patras, Greece

    Alexis C. Kaporis & Paul G. Spirakis

  3. Dept. of Information & Communication Systems Eng., Univ. of the Aegean, Samos, Greece

    Dimitris Fotakis

Authors
  1. Dimitris Fotakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexis C. Kaporis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paul G. Spirakis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität Paderborn, Fürstenallee 11, 33102, Paderborn, Germany

    Burkhard Monien  & Ulf-Peter Schroeder  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fotakis, D., Kaporis, A.C., Spirakis, P.G. (2008). Atomic Congestion Games: Fast, Myopic and Concurrent. In: Monien, B., Schroeder, UP. (eds) Algorithmic Game Theory. SAGT 2008. Lecture Notes in Computer Science, vol 4997. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79309-0_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-79309-0_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-79308-3

  • Online ISBN: 978-3-540-79309-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation