# 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, +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

## A Unifying Approximate Potential for Weighted Congestion Games

• Mathematics, Computer Science
• ArXiv
• 2020

#### References

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

## Algorithms for pure Nash equilibria in weighted congestion games

• Mathematics, Computer Science
• JEAL
• 2007

## An Improved Algorithm for Computing Approximate Equilibria in Weighted Congestion Games

• Mathematics, Computer Science
• ArXiv
• 2018

## Approximate Pure Nash Equilibria in Weighted Congestion Games

• Computer Science, Mathematics
• APPROX-RANDOM
• 2014

## Approximate Pure Nash Equilibria in Weighted Congestion Games: Existence, Efficient Computation, and Structure

• Mathematics, Computer Science
• TEAC
• 2015

## Atomic resource sharing in noncooperative networks

• Computer Science
• Proceedings of INFOCOM '97
• 1997

## Computational Complexity

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

## Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games

• Computer Science, Mathematics
• WINE
• 2017

## Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games

• Computer Science, Mathematics
• 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
• 2011