The following publications are possibly variants of this publication:
- Approximate pure nash equilibria in weighted congestion games: existence, efficient computation, and structureIoannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik. sigecom 2012: 284-301 [doi]
- Approximate Pure Nash Equilibria in Weighted Congestion GamesChristoph Hansknecht, Max Klimm, Alexander Skopalik. approx 2014: 242-257 [doi]
- Efficient Computation of Approximate Pure Nash Equilibria in Congestion GamesIoannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik. focs 2011: 532-541 [doi]
- Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion GamesMatthias Feldotto, Martin Gairing, Grammateia Kotsialou, Alexander Skopalik. wine 2017: 191-204 [doi]
- On Approximate Pure Nash Equilibria in Weighted Congestion Games with Polynomial LatenciesIoannis Caragiannis, Angelo Fanelli 0001. icalp 2019: [doi]
- On approximate pure Nash equilibria in weighted congestion games with polynomial latenciesIoannis Caragiannis, Angelo Fanelli 0001. jcss, 117:40-48, 2021. [doi]
- Improving Approximate Pure Nash Equilibria in Congestion GamesVipin Ravindran Vijayalakshmi, Alexander Skopalik. wine 2020: 280-294 [doi]
- Computing approximate pure Nash equilibria in congestion gamesIoannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik. sigecom, 11(1):26-29, 2012. [doi]