Existence and Complexity of Approximate Equilibria in Weighted Congestion Games

@inproceedings{Christodoulou2020ExistenceAC,
  title={Existence and Complexity of Approximate Equilibria in Weighted Congestion Games},
  author={George Christodoulou and Martin Gairing and Yiannis Giannakopoulos and Diogo Poças and Clara Waldmann},
  booktitle={ICALP},
  year={2020}
}
  • George Christodoulou, Martin Gairing, +2 authors Clara Waldmann
  • Published in ICALP 2020
  • Computer Science, Mathematics
  • We study the existence of approximate pure Nash equilibria ($\alpha$-PNE) in weighted atomic congestion games with polynomial cost functions of maximum degree $d$. Previously it was known that $d$-approximate equilibria always exist, while nonexistence was established only for small constants, namely for $1.153$-PNE. We improve significantly upon this gap, proving that such games in general do not have $\tilde{\Theta}(\sqrt{d})$-approximate PNE, which provides the first super-constant lower… CONTINUE READING

    Citations

    Publications citing this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 38 REFERENCES

    Atomic resource sharing in noncooperative networks

    Computational Complexity

    • S. Vadhan
    • Computer Science
    • Encyclopedia of Cryptography and Security
    • 2011
    VIEW 1 EXCERPT

    Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games