On Approximate Pure Nash Equilibria in Weighted Congestion Games with Polynomial Latencies

DOI10.4230/LIPIcs.ICALP.2019.133OpenAlexW2966118758MaRDI QIDQ5092336

Ioannis Caragiannis, Angelo Fanelli

Publication date: 21 July 2022

Full work available at URL: https://hal.science/hal-02431939

zbMATH Keywords

congestion gamespotential functionsapproximate price of stabilityapproximate pure Nash equilibrium

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (2)

Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses ⋮ A unifying approximate potential for weighted congestion games

Cites Work

• Convergence to approximate Nash equilibria in congestion games
• Tight bounds for selfish and greedy load balancing
• Selfish unsplittable flows
• Approximate Pure Nash Equilibria in Weighted Congestion Games
• Exact Price of Anarchy for Polynomial Congestion Games
• On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games
• The Price of Stability of Weighted Congestion Games
• Algorithms – ESA 2005
• On the Existence of Pure Nash Equilibria in Weighted Congestion Games

This page was built for publication: On Approximate Pure Nash Equilibria in Weighted Congestion Games with Polynomial Latencies