Atomic Congestion Games: Fast, Myopic and Concurrent

We study here the effect of concurrent greedy moves of players in atomic congestion games where nselfish agents (players) wish to select a resource each (out of mresources) 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.

[1]  Vahab S. Mirrokni,et al.  Sink equilibria and convergence , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[2]  Jörgen W. Weibull,et al.  Evolutionary Game Theory , 1996 .

[3]  Vahab S. Mirrokni,et al.  Convergence Issues in Competitive Games , 2004, APPROX-RANDOM.

[4]  Avrim Blum,et al.  Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing games , 2006, PODC '06.

[5]  Yishay Mansour,et al.  Fast convergence of selfish rerouting , 2005, SODA '05.

[6]  Yoav Shoham,et al.  Fast and Compact: A Simple Class of Congestion Games , 2005, AAAI.

[7]  Steve Chien,et al.  Convergence to approximate Nash equilibria in congestion games , 2007, SODA '07.

[8]  L. A. Goldberg,et al.  Distributed selfish load balancing , 2006, SODA 2006.

[9]  William H. Sandholm,et al.  Population Games And Evolutionary Dynamics , 2010, Economic learning and social evolution.

[10]  R. Rosenthal.  A class of games possessing pure-strategy Nash equilibria , 1973 .

[11]  Ariel Orda,et al.  Competitive routing in multiuser communication networks , 1993, TNET.

[12]  Berthold Vöcking,et al.  Adaptive routing with stale information , 2005, PODC '05.

[13]  Michael Mitzenmacher,et al.  How Useful Is Old Information? , 2000, IEEE Trans. Parallel Distributed Syst..

[14]  Seyed Hossein Hosseini,et al.  Analysis of a Graph Coloring Based Distributed Load Balancing Algorithm , 1990, J. Parallel Distributed Comput..

[15]  Christos H. Papadimitriou,et al.  The complexity of pure Nash equilibria , 2004, STOC '04.

[16]  Éva Tardos,et al.  The effect of collusion in congestion games , 2006, STOC '06.

[17]  Ariel Orda,et al.  Atomic Resource Sharing in Noncooperative Networks , 2001, Telecommun. Syst..

[18]  Yishay Mansour,et al.  Convergence Time to Nash Equilibria , 2003, ICALP.

[19]  Yossi Azar,et al.  The Price of Routing Unsplittable Flow , 2005, STOC '05.

[20]  L. Shapley,et al.  REGULAR ARTICLEPotential Games , 1996 .

[21]  Jianhua Cao,et al.  An approximate analysis of load balancing using stale state information for servers in parallel , 2003 .

[22]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

[23]  Berthold Vöcking,et al.  Fast convergence to Wardrop equilibria by adaptive sampling methods , 2006, STOC '06.

[24]  Amos Fiat,et al.  Making commitments in the face of uncertainty: how to pick a winner almost every time (extended abstract) , 1996, STOC '96.

[25]  Paul W. Goldberg,et al.  Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game , 2004, PODC '04.

[26]  Paul G. Spirakis,et al.  Atomic congestion games among coalitions , 2008, TALG.

[27]  Elias Koutsoupias,et al.  The price of anarchy of finite congestion games , 2005, STOC '05.

[28]  A. Khanna,et al.  The revised ARPANET routing metric , 1989, SIGCOMM 1989.

[29]  William H. Sandholm,et al.  Potential Games with Continuous Player Sets , 2001, J. Econ. Theory.

[30]  Roberto Montemanni,et al.  Design patterns from biology for distributed computing , 2006, TAAS.

[31]  Michael Dahlin.  Interpreting Stale Load Information , 2000, IEEE Trans. Parallel Distributed Syst..

[32]  G. Oehlert.  A note on the delta method , 1992 .

[33]  Christos H. Papadimitriou,et al.  Worst-case equilibria , 1999 .

[34]  S. Muthukrishnan,et al.  Dynamic load balancing in parallel and distributed networks by random matchings (extended abstract) , 1994, SPAA '94.

[35]  Vahab S. Mirrokni,et al.  Convergence and approximation in potential games , 2006, Theor. Comput. Sci..

[36]  Yoav Shoham,et al.  Dispersion games: general definitions and some specific learning results , 2002, AAAI/IAAI.

[37]  Holger Arndt,et al.  Load balancing: dimension exchange on product graphs , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[38]  George Cybenko,et al.  Dynamic Load Balancing for Distributed Memory Multiprocessors , 1989, J. Parallel Distributed Comput..

[39]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[40]  Berthold Vöcking,et al.  On the Impact of Combinatorial Structure on Congestion Games , 2006, FOCS.

[41]  Paul G. Spirakis,et al.  Selfish unsplittable flows , 2005, Theor. Comput. Sci..