Congestion Games with Complementarities
From MaRDI portal
Publication:5283369
DOI10.1007/978-3-319-57586-5_19zbMath1489.91012arXiv1701.07304OpenAlexW2584358671MaRDI QIDQ5283369
Lennart Leder, Alexander Skopalik, Matthias Feldotto
Publication date: 21 July 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.07304
aggregationcongestion gamesexistence of equilibriacomplementarities\(L_p\) normsapproximate pure Nash equilibria
Cites Work
- Unnamed Item
- Unnamed Item
- Computing pure Nash and strong equilibria in bottleneck congestion games
- Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games
- Convergence to approximate Nash equilibria in congestion games
- On the performance of approximate equilibria in congestion games
- Pure Nash equilibria in player-specific and weighted congestion games
- Potential games
- Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
- Congestion games with player-specific payoff functions
- Congestion games revisited
- A class of games possessing pure-strategy Nash equilibria
- Selfish unsplittable flows
- Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria
- Congestion Games with Mixed Objectives
- Approximate Pure Nash Equilibria in Weighted Congestion Games
- On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games
- Intrinsic Robustness of the Price of Anarchy
- On the impact of combinatorial structure on congestion games
- Congestion Games with Player-Specific Constants
- Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games
- The complexity of pure Nash equilibria
- Games with Congestion-Averse Utilities
- Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games
This page was built for publication: Congestion Games with Complementarities
