Congestion games viewed from M-convexity

Congestion games have extensively been studied till recently. It is shown by Fotakis (2010) that for every congestion game on an extension-parallel network, any best-response sequence reaches a pure Nash equilibrium of the game in n steps, where n is the number of players. We show that the fast convergence of best-response sequences results from M-convexity (of Murota (1996)) of the potential function associated with the game. We also give a characterization of M-convex functions in terms of greedy algorithms.

[1]  Igal Milchtaich,et al.  Topological Conditions for Uniqueness of Equilibrium in Networks , 2005, Math. Oper. Res..

[2]  Akiyoshi Shioura,et al.  Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem , 2004, Discret. Appl. Math..

[3]  L. Shapley,et al.  Potential Games , 1994 .

[4]  W. T. Tutte.  Connectivity in graphs , 1966 .

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

[6]  R. Holzman,et al.  Strong Equilibrium in Congestion Games , 1997 .

[7]  P. Favati.  Convexity in nonlinear integer programming , 1990 .

[8]  Walter Wenzel,et al.  Valuated matroids: a new look at the greedy algorithm , 1989 .

[9]  Kazuo Murota,et al.  Discrete convex analysis , 1998, Math. Program..

[10]  Takashi Ui,et al.  Discrete Concavity for Potential Games , 2008, IGTR.

[11]  Berthold Vöcking,et al.  On the Impact of Combinatorial Structure on Congestion Games , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[12]  K. Murota,et al.  M-convex functions and tree metrics , 2004 .

[13]  Dimitris Fotakis.  Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy , 2009, Theory of Computing Systems.

[14]  K. Murota.  Convexity and Steinitz's Exchange Property , 1996 .

[15]  Ron Holzman,et al.  Network structure and strong equilibrium in route selection games , 2003, Math. Soc. Sci..

[16]  A. Tamura,et al.  GROSS SUBSTITUTES CONDITION AND DISCRETE CONCAVITY FOR MULTI-UNIT VALUATIONS: A SURVEY , 2015 .

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

[18]  Akihisa Tamura,et al.  Applications of Discrete Convex Analysis to Mathematical Economics , 2004 .

[19]  Nahum Shimkin,et al.  Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users , 2007, Math. Oper. Res..

[20]  Kazuo Murota,et al.  Note on Multimodularity and L-Convexity , 2005, Math. Oper. Res..

[21]  Akihisa Tamura.  Coordinatewise domain scaling algorithm for M-convex function minimization , 2005, Math. Program..

[22]  Akiyoshi Shioura,et al.  Minimization of an M-convex Function , 1998, Discret. Appl. Math..

[23]  Satoru Fujishige,et al.  Submodular functions and optimization , 1991 .

[24]  Rann Smorodinsky,et al.  Greediness and Equilibrium in Congestion Games , 2011, ArXiv.

[25]  Kazuo Murota,et al.  Discrete convexity and equilibria in economies with indivisible goods and money , 2001, Math. Soc. Sci..

[26]  Yehoshua Perl,et al.  Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph , 1978, JACM.

[27]  Yishay Mansour,et al.  Efficient graph topologies in network routing games , 2009, Games Econ. Behav..