scientific article; zbMATH DE number 7204995

DOI10.4230/LIPIcs.ESA.2017.17zbMath1448.91020arXiv2202.12173MaRDI QIDQ5111703

Vittorio Bilò, Cosimo Vinci

Publication date: 27 May 2020

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Nash equilibriumcongestion gamesgreedy algorithmsprice of anarchyonline load balancing

Mathematics Subject Classification ID

Potential and congestion games (91A14) Algorithmic game theory and complexity (91A68)

Related Items (13)

Unnamed Item ⋮ Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses ⋮ Price of anarchy for parallel link networks with generalized mean objective ⋮ Inefficiency of pure Nash equilibria in series-parallel network congestion games ⋮ The power of one evil secret agent ⋮ Using Temporal Dummy Players in Cost-Sharing Games ⋮ Non-atomic one-round walks in congestion games ⋮ Congestion games with priority-based scheduling ⋮ The price of anarchy of affine congestion games with similar strategies ⋮ Cost-sharing games in real-time scheduling systems ⋮ On the robustness of the approximate price of anarchy in generalized congestion games ⋮ The Price of Stability of Weighted Congestion Games ⋮ The Price of Stability of Weighted Congestion Games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence and approximation in potential games
• On the performance of approximate equilibria in congestion games
• Tight bounds for selfish and greedy load balancing
• Performance of one-round walks in linear congestion games
• The price of anarchy for polynomial social cost
• Selfish load balancing and atomic congestion games
• A new model for selfish routing
• Stackelberg strategies for atomic congestion games
• Pure Nash equilibria in player-specific and weighted congestion games
• A class of games possessing pure-strategy Nash equilibria
• Selfish unsplittable flows
• Efficiency of Equilibria in Uniform Matroid Congestion Games
• Exact Price of Anarchy for Polynomial Congestion Games
• Intrinsic Robustness of the Price of Anarchy
• On the impact of combinatorial structure on congestion games
• The Curse of Sequentiality in Routing Games
• The complexity of pure Nash equilibria
• The price of anarchy of finite congestion games
• Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness
• Equilibrium points in n -person games
• On the Existence of Pure Nash Equilibria in Weighted Congestion Games
• The Price of Routing Unsplittable Flow

This page was built for publication: