Performance of one-round walks in linear congestion games

DOI10.1007/S00224-010-9309-0MaRDI QIDQ647486zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Performances of One-Round Walks in Linear Congestion Games
• scientific article; zbMATH DE number 5823841
• Non-atomic one-round walks in congestion games
• Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
• Congestion games with linearly independent paths: convergence time and price of anarchy
• On the Performance of Approximate Equilibria in Congestion Games
• On the performance of approximate equilibria in congestion games
• On the inefficiency of equilibria in linear bottleneck congestion games
• A First Step Towards Analyzing the Convergence Time in Player-Specific Singleton Congestion Games

Cites work

• scientific article; zbMATH DE number 5485547 (Why is no real title available?)
• A class of games possessing pure-strategy Nash equilibria
• Algorithms for pure Nash equilibria in weighted congestion games
• Algorithms – ESA 2005
• Approximation and Online Algorithms
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Atomic resource sharing in noncooperative networks
• Characterizing the existence of potential functions in weighted congestion games
• Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
• Convergence and Approximation in Potential Games
• Convergence to approximate Nash equilibria in congestion games
• How easy is local search?
• On the existence of pure Nash equilibria in weighted congestion games
• On the impact of combinatorial structure on congestion games
• Potential games
• The Price of Stability for Network Design with Fair Cost Allocation
• 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
• The price of routing unsplittable flow
• Tight Bounds for Selfish and Greedy Load Balancing
• Worst-case equilibria

Cited in

(10)

• The price of anarchy of affine congestion games with similar strategies
• Non-atomic one-round walks in congestion games
• On the performance of mildly greedy players in cut games
• Best-response dynamics in combinatorial auctions with item bidding
• Congestion games with priority-based scheduling
• On the impact of singleton strategies in congestion games
• Performances of One-Round Walks in Linear Congestion Games
• A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games
• scientific article; zbMATH DE number 5823841 (Why is no real title available?)
• On best response dynamics in weighted congestion games with polynomial delays

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q647486)