Efficient Estimation of Equilibria in Large Aggregative Games With Coupling Constraints

Aggregative games have many industrial applications, and computing an equilibrium in those is challenging when the number of players large. In framework atomic aggregative with coupling constraints, we show that variational Nash equilibria a large game can be approximated by Wardrop auxiliary population smaller dimension. Each this corresponds to group initial game. This approach enables efficient computation equilibrium, as inequality characterizing dimension than one. illustrated example smart grid context.