Abstract
We consider the framework of aggregative games, in which the cost function of each agent depends on his own strategy and on the average population strategy. As first contribution, we investigate the relations between the concepts of Nash and Wardrop equilibria. By exploiting a characterization of the two equilibria as solutions of variational inequalities, we bound their distance with a decreasing function of the population size. As second contribution, we propose two decentralized algorithms that converge to such equilibria and are capable of coping with constraints coupling the strategies of different agents. Finally, we study the applications of charging of electric vehicles and of route choice on a road network. Show more
Permanent link
https://doi.org/10.3929/ethz-b-000274394Publication status
publishedExternal links
Journal / series
IEEE Transactions on Automatic ControlVolume
Pages / Article No.
Publisher
IEEESubject
Aggregative games; Coupling constraints; Generalized Nash equilibrium; Distributed algorithm; Large-scale systems; Electric vehicles; Vehicle routingOrganisational unit
03751 - Lygeros, John / Lygeros, John
09578 - Kamgarpour, Maryam (ehemalig) / Kamgarpour, Maryam (former)
More
Show all metadata