The Complexity of Approximate Nash Equilibrium in Congestion Games with Negative Delays

Frédéric Magniez, Michel de Rougemont, Miklos Santha, Xavier Zeitoun. The Complexity of Approximate Nash Equilibrium in Congestion Games with Negative Delays. In Ning Chen, Edith Elkind, Elias Koutsoupias, editors, Internet and Network Economics - 7th International Workshop, WINE 2011, Singapore, December 11-14, 2011. Proceedings. Volume 7090 of Lecture Notes in Computer Science, pages 266-277, Springer, 2011. [doi]

@inproceedings{MagniezRSZ11,
  title = {The Complexity of Approximate Nash Equilibrium in Congestion Games with Negative Delays},
  author = {Frédéric Magniez and Michel de Rougemont and Miklos Santha and Xavier Zeitoun},
  year = {2011},
  doi = {10.1007/978-3-642-25510-6_23},
  url = {http://dx.doi.org/10.1007/978-3-642-25510-6_23},
  researchr = {https://researchr.org/publication/MagniezRSZ11},
  cites = {0},
  citedby = {0},
  pages = {266-277},
  booktitle = {Internet and Network Economics - 7th International Workshop, WINE 2011, Singapore, December 11-14, 2011. Proceedings},
  editor = {Ning Chen and Edith Elkind and Elias Koutsoupias},
  volume = {7090},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-25509-0},
}