Performance of one-round walks in linear congestion games

DOI10.1007/S00224-010-9309-0zbMATH Open1278.91011OpenAlexW3155157870MaRDI QIDQ647486FDOQ647486

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (10)

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

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)