Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions

Vittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli. Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions. In Evangelos Markakis, Guido Schäfer, editors, Web and Internet Economics - 11th International Conference, WINE 2015, Amsterdam, The Netherlands, December 9-12, 2015, Proceedings. Volume 9470 of Lecture Notes in Computer Science, pages 118-131, Springer, 2015. [doi]

Abstract

Abstract is missing.