Efficient Estimation of Equilibria of Large Congestion Games with Heterogeneous Players

Computing an equilibrium in congestion games can be challenging when the number of players is large. Yet, it is a problem to be addressed in practice, for instance to forecast the state of the system and be able to control it. In this work, we analyze the case of generalized atomic congestion games, with coupling constraints, and with players that are heterogeneous through their action sets and their utility functions. We obtain an approximation of the variational Nash equilibria---a notion generalizing Nash equilibria in the presence of coupling constraints---of a large atomic congestion game by an equilibrium of an auxiliary population game, where each population corresponds to a group of atomic players of the initial game. Because the variational inequalities characterizing the equilibrium of the auxiliary game have smaller dimension than the original problem, this approach enables the fast computation of an estimation of equilibria in a large congestion game with thousands of heterogeneous players.

[1]  G. Cohen Auxiliary problem principle extended to variational inequalities , 1988 .

[2]  Francisco Facchinei,et al.  Monotone Games for Cognitive Radio Systems , 2012 .

[3]  Patrice Marcotte,et al.  Modified descent methods for solving the monotone variational inequality problem , 1993, Oper. Res. Lett..

[4]  Lacra Pavel,et al.  Asynchronous distributed algorithm for seeking generalized Nash equilibria , 2018, 2018 European Control Conference (ECC).

[5]  Francisco Facchinei,et al.  Generalized Nash Equilibrium Problems , 2010, Ann. Oper. Res..

[6]  M. Carrion,et al.  A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem , 2006, IEEE Transactions on Power Systems.

[7]  Francesca Parise,et al.  Nash and Wardrop Equilibria in Aggregative Games With Coupling Constraints , 2017, IEEE Transactions on Automatic Control.

[8]  Vincent W. S. Wong,et al.  Autonomous Demand-Side Management Based on Game-Theoretic Energy Consumption Scheduling for the Future Smart Grid , 2010, IEEE Transactions on Smart Grid.

[9]  Marc Willinger,et al.  Road Traffic Congestion and Public Information: An Experimental Investigation , 2006 .

[10]  Masao Fukushima,et al.  A relaxed projection method for variational inequalities , 1986, Math. Program..

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

[12]  P. Marcotte,et al.  A bilevel model of taxation and its application to optimal highway pricing , 1996 .

[13]  Peter Palensky,et al.  Demand Side Management: Demand Response, Intelligent Energy Systems, and Smart Loads , 2011, IEEE Transactions on Industrial Informatics.

[14]  P. Marcotte,et al.  A bilevel modelling approach to pricing and fare optimisation in the airline industry , 2003 .

[15]  Lacra Pavel,et al.  A distributed primal-dual algorithm for computation of generalized Nash equilibria with shared affine coupling constraints via operator splitting methods , 2017, ArXiv.

[16]  F. Facchinei,et al.  Finite-Dimensional Variational Inequalities and Complementarity Problems , 2003 .

[17]  Martine Labbé,et al.  A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network , 2000, Transp. Sci..

[18]  Martine Labbé,et al.  A Bilevel Model and Solution Algorithm for a Freight Tariff-Setting Problem , 2000, Transp. Sci..

[19]  Tim Roughgarden,et al.  Algorithmic Game Theory , 2007 .

[20]  P. Brucker Review of recent development: An O( n) algorithm for quadratic knapsack problems , 1984 .

[21]  J. S. Pang,et al.  The Generalized Quasi-Variational Inequality Problem , 1982, Math. Oper. Res..

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

[23]  Maryam Kamgarpour,et al.  Learning Generalized Nash Equilibria in a Class of Convex Games , 2017, IEEE Transactions on Automatic Control.

[24]  Umang Bhaskar,et al.  Equilibria of atomic flow games are not unique , 2009, SODA.

[25]  Robert G. Batson Combinatorial behavior of extreme points of perturbed polyhedra , 1987 .

[26]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[27]  Ankur A. Kulkarni,et al.  On the variational equilibrium as a refinement of the generalized Nash equilibrium , 2012, Autom..

[28]  Eitan Altman,et al.  A survey on networking games in telecommunications , 2006, Comput. Oper. Res..

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

[30]  Walid Saad,et al.  Game-Theoretic Methods for the Smart Grid: An Overview of Microgrid Systems, Demand-Side Management, and Smart Grid Communications , 2012, IEEE Signal Processing Magazine.

[31]  Paulin Jacquot,et al.  Routing Game on Parallel Networks: The Convergence of Atomic to Nonatomic , 2018, 2018 IEEE Conference on Decision and Control (CDC).

[32]  Eitan Altman,et al.  Joint Operator Pricing and Network Selection Game in Cognitive Radio Networks: Equilibrium, System Dynamics and Price of Anarchy , 2013, IEEE Transactions on Vehicular Technology.

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

[34]  Michael Randolph Garey,et al.  The complexity of the generalized Lloyd - Max problem , 1982, IEEE Trans. Inf. Theory.

[35]  Patrice Marcotte,et al.  An overview of bilevel optimization , 2007, Ann. Oper. Res..

[36]  Raman Paranjape,et al.  Optimal Residential Demand Response for Multiple Heterogeneous Homes With Real-Time Price Prediction in a Multiagent Framework , 2017, IEEE Transactions on Smart Grid.

[37]  Paulin Jacquot,et al.  Nonsmooth Aggregative Games with Coupling Constraints and Infinitely Many Classes of Players , 2018, ArXiv.

[38]  J. G. Wardrop,et al.  Some Theoretical Aspects of Road Traffic Research , 1952 .

[39]  Farrokh Albuyeh,et al.  Grid of the future , 2009, IEEE Power and Energy Magazine.

[40]  Nadia Oudjane,et al.  Analysis and Implementation of an Hourly Billing Mechanism for Demand Response Management , 2017, IEEE Transactions on Smart Grid.

[41]  P. Harker Generalized Nash games and quasi-variational inequalities , 1991 .

[42]  Heinz H. Bauschke,et al.  Convex Analysis and Monotone Operator Theory in Hilbert Spaces , 2011, CMS Books in Mathematics.

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

[44]  J. Nash Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.

[45]  Francesca Parise,et al.  A distributed algorithm for average aggregative games with coupling constraints , 2017, ArXiv.

[46]  Lacra Pavel,et al.  Asynchronous Distributed Algorithms for Seeking Generalized Nash Equilibria Under Full and Partial-Decision Information , 2018, IEEE Transactions on Cybernetics.