1. Exact price of anarchy for polynomial congestion games;Aland;SIAM J. Comput.,2011
2. Fast convergence to nearly optimal solutions in potential games;Awerbuch,2008
3. Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions;Bilò,2015
4. Efficient computation of approximate pure Nash equilibria in congestion games;Caragiannis,2011
5. Approximate pure Nash equilibria in weighted congestion games: existence, efficient computation, and structure;Caragiannis;ACM Trans. Econ. Comput.,2015