The following publications are possibly variants of this publication:
- Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion GamesMatthias Feldotto, Martin Gairing, Grammateia Kotsialou, Alexander Skopalik. wine 2017: 191-204 [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]
- On the Existence of Pure Nash Equilibria in Weighted Congestion GamesTobias Harks, Max Klimm. icalp 2010: 79-89 [doi]
- On the Existence of Pure Nash Equilibria in Weighted Congestion GamesTobias Harks, Max Klimm. mor, 37(3):419-436, 2012. [doi]
- 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 Games: Existence, Efficient Computation, and StructureIoannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik. teco, 3(1):2, 2015. [doi]
- Approximate Pure Nash Equilibria in Social Context Congestion GamesMartin Gairing, Grammateia Kotsialou, Alexander Skopalik. wine 2014: 480-485 [doi]
- Bounding the Potential Function in Congestion Games and Approximate Pure Nash EquilibriaMatthias Feldotto, Martin Gairing, Alexander Skopalik. wine 2014: 30-43 [doi]
- Efficient Computation of Approximate Pure Nash Equilibria in Congestion GamesIoannis Caragiannis, Angelo Fanelli, Nick Gravin, Alexander Skopalik. focs 2011: 532-541 [doi]