Approximate Pure Nash Equilibria in Weighted Congestion Games

Christoph Hansknecht, Max Klimm, Alexander Skopalik. Approximate Pure Nash Equilibria in Weighted Congestion Games. In Klaus Jansen, José D. P. Rolim, Nikhil R. Devanur, Cristopher Moore, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain. Volume 28 of LIPIcs, pages 242-257, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2014. [doi]

@inproceedings{HansknechtKS14,
  title = {Approximate Pure Nash Equilibria in Weighted Congestion Games},
  author = {Christoph Hansknecht and Max Klimm and Alexander Skopalik},
  year = {2014},
  doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.242},
  url = {http://dx.doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.242},
  researchr = {https://researchr.org/publication/HansknechtKS14},
  cites = {0},
  citedby = {0},
  pages = {242-257},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain},
  editor = {Klaus Jansen and José D. P. Rolim and Nikhil R. Devanur and Cristopher Moore},
  volume = {28},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-939897-74-3},
}