International audienceAggregative games have many industrial applications, and computing an equilibrium in those games is challenging when the number of players is large. In the framework of atomic aggregative games with coupling constraints, we show that variational Nash equilibria of a large aggregative game can be approximated by a Wardrop equilibrium of an auxiliary population game of smaller dimension. Each population of this auxiliary game corresponds to a group of atomic players of the initial large game. This approach enables an efficient computation of an approximated equilibrium, as the variational inequality characterizing the Wardrop equilibrium is of smaller dimension than the initial one. This is illustrated on an exampl...
AbstractA widely accepted rational behavior for non-cooperative players is based on the notion of Na...
We prove that in every normal form n-player game with m actions for each player, there exists an app...
We present a new approach for solving large (even infinite) multiplayer games of imperfect informatio...
International audienceAggregative games have many industrial applications, and computing an equilibr...
We consider the framework of aggregative games, in which the cost function of each agent depends on ...
We consider the framework of aggregative games, in which the cost function of each agent depends on ...
This thesis studies equilibrium problems in aggregative games. A game describes the interaction amon...
After defining a pure-action profile in a nonatomic aggregative game, where players have specific co...
We define and analyze the notion of variational Wardrop equilibrium for nonatomic aggregative games ...
We analyse deterministic aggregative games, with large but finite number of players, that are subjec...
We characterize Nash equilibria of games with a continuum of players in terms of approximate equili...
We study the existence and uniqueness of Nash equilibria for a certain class of aggregative games wi...
We consider the framework of average aggregative games, where the cost function of each agent depend...
We consider the question of whether and in what sense, Wardrop equilibria provide a good approximati...
AbstractA widely accepted rational behavior for non-cooperative players is based on the notion of Na...
We prove that in every normal form n-player game with m actions for each player, there exists an app...
We present a new approach for solving large (even infinite) multiplayer games of imperfect informatio...
International audienceAggregative games have many industrial applications, and computing an equilibr...
We consider the framework of aggregative games, in which the cost function of each agent depends on ...
We consider the framework of aggregative games, in which the cost function of each agent depends on ...
This thesis studies equilibrium problems in aggregative games. A game describes the interaction amon...
After defining a pure-action profile in a nonatomic aggregative game, where players have specific co...
We define and analyze the notion of variational Wardrop equilibrium for nonatomic aggregative games ...
We analyse deterministic aggregative games, with large but finite number of players, that are subjec...
We characterize Nash equilibria of games with a continuum of players in terms of approximate equili...
We study the existence and uniqueness of Nash equilibria for a certain class of aggregative games wi...
We consider the framework of average aggregative games, where the cost function of each agent depend...
We consider the question of whether and in what sense, Wardrop equilibria provide a good approximati...
AbstractA widely accepted rational behavior for non-cooperative players is based on the notion of Na...
We prove that in every normal form n-player game with m actions for each player, there exists an app...
We present a new approach for solving large (even infinite) multiplayer games of imperfect informatio...