On approximate pure Nash equilibria in weighted congestion games with polynomial latencies

DOI10.1016/j.jcss.2020.10.007zbMath1480.91023arXiv1902.07173OpenAlexW3100479849MaRDI QIDQ2221800

Angelo Fanelli, Ioannis Caragiannis

Publication date: 2 February 2021

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

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

zbMATH Keywords

potential functionsprice of stabilityweighted congestion gamesapproximate pure Nash equilibria

Mathematics Subject Classification ID

Potential and congestion games (91A14) Equilibrium refinements (91A11)

Related Items (1)

Computing approximate Nash equilibria in network congestion games with polynomially decreasing cost functions

Cites Work

• Convergence to approximate Nash equilibria in congestion games
• Tight bounds for selfish and greedy load balancing
• A class of games possessing pure-strategy Nash equilibria
• 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
• Computing Approximate Nash Equilibria in Network Congestion Games with Polynomially Decreasing Cost Functions
• Algorithms for pure Nash equilibria in weighted congestion games
• Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games
• The Price of Stability of Weighted Congestion Games
• Price of Stability in Polynomial Congestion Games
• Algorithms – ESA 2005
• Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games
• On the Existence of Pure Nash Equilibria in Weighted Congestion Games
• Atomic resource sharing in noncooperative networks

This page was built for publication: On approximate pure Nash equilibria in weighted congestion games with polynomial latencies