Existence and Complexity of Approximate Equilibria in Weighted Congestion Games

DOI10.1287/moor.2022.1272arXiv2002.07466OpenAlexW3005899439MaRDI QIDQ6199254

Martin Gairing, Yiannis Giannakopoulos, George Christodoulou, Clara Waldmann, Diogo Poças

Publication date: 23 February 2024

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.07466

zbMATH Keywords

existence of equilibriapure Nash equilibriaapproximate equilibriaweighted congestion gamesatomic congestion gameshardness of equilibria

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Potential and congestion games (91A14) Algorithmic game theory and complexity (91A68)

This page was built for publication: Existence and Complexity of Approximate Equilibria in Weighted Congestion Games