Performance of one-round walks in linear congestion games

DOI10.1007/s00224-010-9309-0zbMath1278.91011OpenAlexW3155157870MaRDI QIDQ647486

Vittorio Bilò, Angelo Fanelli, Luca Moscardelli, Michele Flammini

Publication date: 23 November 2011

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-010-9309-0

Mathematics Subject Classification ID

Noncooperative games (91A10) Applications of game theory (91A80)

Related Items (8)

Best-response dynamics in combinatorial auctions with item bidding ⋮ On the performance of mildly greedy players in cut games ⋮ On best response dynamics in weighted congestion games with polynomial delays ⋮ Non-atomic one-round walks in congestion games ⋮ Congestion games with priority-based scheduling ⋮ A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games ⋮ The price of anarchy of affine congestion games with similar strategies ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• How easy is local search?
• Potential games
• A class of games possessing pure-strategy Nash equilibria
• The Price of Stability for Network Design with Fair Cost Allocation
• On the impact of combinatorial structure on congestion games
• Algorithms for pure Nash equilibria in weighted congestion games
• The Speed of Convergence in Congestion Games under Best-Response Dynamics
• The complexity of pure Nash equilibria
• The price of anarchy of finite congestion games
• Tight Bounds for Selfish and Greedy Load Balancing
• Characterizing the Existence of Potential Functions in Weighted Congestion Games
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Convergence and Approximation in Potential Games
• Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
• Algorithms – ESA 2005
• Approximation and Online Algorithms
• The Price of Routing Unsplittable Flow
• On the Existence of Pure Nash Equilibria in Weighted Congestion Games
• Atomic resource sharing in noncooperative networks

This page was built for publication: Performance of one-round walks in linear congestion games