9 citations · 9 across the 2 of their papers we have counts for
2 papers
cs.GT2022
-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…
cs.GT2020★ 9 cited
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.