9 citations · 22 across the 13 of their papers we have counts for
5 papers · 1 filter
-approximate pure Nash equilibria algorithms for weighted congestion games and their runtimes
Ren Chunying, Wu Zijun, Xu Dachuan +1
This paper concerns computing approximate pure Nash equilibria in weighted congestion games, which has been shown to be PLS-complete. With the help of -game and approximate…
On the Population Monotonicity of Independent Set Games
Libing Wang, Han Xiao, Donglei Du +1
An independent set game is a cooperative game defined on graphs and dealing with profit-sharing in maximum independent set problems. A population monotonic allocation scheme is a r…
A convergence analysis of the price of anarchy in atomic congestion games
Zijun Wu, Rolf H. Moehring, Chunying Ren +1
This paper provides a comprehensive convergence analysis of the PoA of both pure and mixed Nash equilibria in atomic congestion games with unsplittable demands.
Selfishness need not be bad: a general proof
Zijun Wu, Rolf H. Möhring, Dachuan Xu
This article studies the user behavior in non-atomic congestion games. We consider non-atomic congestion games with continuous and non-decreasing functions and investigate the limi…
Selfishness need not be bad
Wu Zijun, Moehring Rolf H., Chen Yanyan +1
We investigate the price of anarchy (PoA) in non-atomic congestion games when the total demand gets very large. First results in this direction have recently been obtained by \…