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
Showing cs.GTShow all

7 papers · 1 filter

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…

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…

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…