# 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} }

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

## Computational Complexity

VIEW 1 EXCERPT