A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games
From MaRDI portal
Publication:722221
DOI10.1007/s00224-017-9826-1zbMath1394.91015arXiv1110.5439OpenAlexW1616868910MaRDI QIDQ722221
Publication date: 23 July 2018
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1110.5439
congestion games(approximate) Nash equilibriaprice of anarchy and stabilityperformance of one-round walksprimal-dual analysis
Related Items (9)
Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses ⋮ Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship ⋮ Congestion games with priority-based scheduling ⋮ The price of anarchy of affine congestion games with similar strategies ⋮ The sequential price of anarchy for affine congestion games with few players ⋮ Project games ⋮ On Stackelberg strategies in affine congestion games ⋮ On the robustness of the approximate price of anarchy in generalized congestion games ⋮ The Price of Stability of Weighted Congestion Games
Cites Work
- Unnamed Item
- Unnamed Item
- On the performance of mildly greedy players in cut games
- 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
- Characterizing the existence of potential functions in weighted congestion games
- Analysis of approximation algorithms for \(k\)-set cover using factor-revealing linear programs
- Selfish load balancing and atomic congestion games
- Stackelberg strategies for atomic congestion games
- Some anomalies of farsighted strategic behavior
- Oblivious algorithms for the maximum directed cut problem
- A class of games possessing pure-strategy Nash equilibria
- On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games
- The curse of simultaneity
- A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games
- On Linear Congestion Games with Altruistic Social Context
- On lookahead equilibria in congestion games
- Exact Price of Anarchy for Polynomial Congestion Games
- Taxes for linear atomic congestion games
- The Price of Stability for Network Design with Fair Cost Allocation
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- On Stackelberg Strategies in Affine Congestion Games
- Algorithms for pure Nash equilibria in weighted congestion games
- The price of anarchy of finite congestion games
- Strong and Pareto Price of Anarchy in Congestion Games
- A Theoretical Examination of Practical Game Playing: Lookahead Search
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Price of Stability in Polynomial Congestion Games
- Online bipartite matching with random arrivals
- Algorithms – ESA 2005
- On the Existence of Pure Nash Equilibria in Weighted Congestion Games
- Approximation and Online Algorithms
- Wavelength Management in WDM Rings to Maximize the Number of Connections
- The Price of Routing Unsplittable Flow
This page was built for publication: A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games
