activity
20122022
most citedNonsmooth Aggregative Games with Coupling Constraints and Infinitely Many Classes of Players

9 citations · 14 across the 9 of their papers we have counts for

collaborators

14 papers

math.OC2022

Large-scale nonconvex optimization: randomization, gap estimation, and numerical resolution

J. Frédéric Bonnans, Kang Liu, Nadia Oudjane +2

We address a large-scale and nonconvex optimization problem, involving an aggregative term. This term can be interpreted as the sum of the contributions of N agents to some common…

math.OC2021

Computation and implementation of an optimal mean field control for smart charging

Adrien Seguret, Cheng Wan, Clémence Alasseur

This paper addresses an optimal control problem for a large population of identical plug-in electric vehicles (PEVs). The number of PEVs being large, the mean field assumption is f…

eess.SY2021★ 3 cited

A privacy-preserving distributed computational approach for distributed locational marginal prices

Olivier Bilenne, Paulin Jacquot, Nadia Oudjane +3

An important issue in today's electricity markets is the management of flexibilities offered by new practices, such as smart home appliances or electric vehicles. By inducing chang…

math.OC2020

Approximate Nash equilibria in large nonconvex aggregative games

Kang Liu, Nadia Oudjane, Cheng Wan

This paper shows the existence of -Nash equilibria in -player noncooperative sum-aggregative games in which the players' cost functions, depending on…

cs.GT2019

Efficient Estimation of Equilibria in Large Aggregative Games with Coupling Constraints

Paulin Jacquot, Cheng Wan, Olivier Beaude +1

Aggregative 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 aggr…

math.OC2019

Nonatomic Aggregative Games with Infinitely Many Types

Paulin Jacquot, Cheng Wan

We define and analyze the notion of variational Wardrop equilibrium for nonatomic aggregative games with an infinity of players types. These equilibria are characterized through an…

math.OC2018

Peer-to-Peer Electricity Market Analysis: From Variational to Generalized Nash Equilibrium

Hélène Le Cadre, Paulin Jacquot, Cheng Wan +1

We consider a network of prosumers involved in peer-to-peer energy exchanges, with differentiation price preferences on the trades with their neighbors, and we analyze two market d…

cs.GT2018

Efficient Estimation of Equilibria of Large Congestion Games with Heterogeneous Players

Cheng Wan, Paulin Jacquot, Olivier Beaude +1

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…

cs.GT2018★ 9 cited

Nonsmooth Aggregative Games with Coupling Constraints and Infinitely Many Classes of Players

Paulin Jacquot, Cheng Wan

After defining a pure-action profile in a nonatomic aggregative game, where players have specific compact convex pure-action sets and nonsmooth convex cost functions, as a square-i…

cs.GT2018

Routing Game on Parallel Networks: the Convergence of Atomic to Nonatomic

Paulin Jacquot, Cheng Wan

We consider an instance of a nonatomic routing game. We assume that the network is parallel, that is, constituted of only two nodes, an origin and a destination. We consider infini…

cs.GT2015★ 1 cited

Composite charging games in networks of electric vehicles

Olivier Beaude, Cheng Wan, Samson Lasaulce

An important scenario for smart grids which encompass distributed electrical networks is given by the simultaneous presence of aggregators and individual consumers. In this work, a…

cs.GT2015

Strategic decentralization in binary choice composite congestion games

Cheng Wan

This paper studies strategic decentralization in binary choice composite network congestion games. A player decentralizes if she lets some autonomous agents to decide respectively…

math.OC2015★ 1 cited

Finite composite games: Equilibria and dynamics

Sylvain Sorin, Cheng Wan

We study games with finitely many participants, each having finitely many choices. We consider the following categories of participants: (I) populations: sets of nonatomic agents,…

cs.GT2012

Coalitions in nonatomic network congestion games

Cheng Wan

This work shows that the formation of a finite number of coalitions in a nonatomic network congestion game benefits everyone. At the equilibrium of the composite game played by coa…