On best response dynamics in weighted congestion games with polynomial delays

DOI10.1007/S00446-011-0145-5MaRDI QIDQ661067zbMATH OpenOpenAlexFDO

Authors Angelo Fanelli, Luca Moscardelli

Publication date 6 February 2012

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00446-011-0145-5

zbMATH Keywords

algorithmic game theorycongestion gamesspeed of convergence

Mathematics Subject Classification ID

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

Recommendations

• The speed of convergence in congestion games under best-response dynamics
• The Speed of Convergence in Congestion Games under Best-Response Dynamics
• Convergence issues in congestion games
• Computing approximate equilibria in weighted congestion games via best-responses
• Convergence to approximate Nash equilibria in congestion games

Cites work

• A class of games possessing pure-strategy Nash equilibria
• A priority-based model of routing
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Automata, Languages and Programming
• Congestion games with player-specific payoff functions
• Convergence and Approximation in Potential Games
• Convergence to approximate Nash equilibria in congestion games
• Distributed Computing
• Equilibrium points in n -person games
• Exact Price of Anarchy for Polynomial Congestion Games
• How easy is local search?
• scientific article; zbMATH DE number 5485547 (Why is no real title available?)
• scientific article; zbMATH DE number 2086616 (Why is no real title available?)
• On the existence of pure Nash equilibria in weighted congestion games
• On the impact of combinatorial structure on congestion games
• Performance of one-round walks in linear congestion games
• Pure Nash equilibria in player-specific and weighted congestion games
• The complexity of pure Nash equilibria
• The price of anarchy of finite congestion games
• The price of routing unsplittable flow
• The speed of convergence in congestion games under best-response dynamics

Cited in

(12)

• Cooperative congestion games: existence of a Nash-stable coalition structure
• Some anomalies of farsighted strategic behavior
• Concurrent imitation dynamics in congestion games
• On the impact of fair best response dynamics
• On Lookahead Equilibria in Congestion Games
• On lookahead equilibria in congestion games
• On the performance of mildly greedy players in cut games
• The Speed of Convergence in Congestion Games under Best-Response Dynamics
• Dynamics of Profit-Sharing Games
• Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness
• The price of anarchy in the congestion game with flow constraints
• The impact of social ignorance on weighted congestion games

This page was built for publication: On best response dynamics in weighted congestion games with polynomial delays

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