Convergence and Approximation in Potential Games

DOI10.1007/11672142_28MaRDI QIDQ5449812zbMATH OpenOpenAlexFDO

Authors George Christodoulou, Anastasios Sidiropoulos, Vahab S. Mirrokni

Publication date 19 March 2008

Published in STACS 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11672142_28

Mathematics Subject Classification ID

Games involving graphs (91A43)

Recommendations

• Convergence and approximation in potential games
• Bounding the potential function in congestion games and approximate pure Nash equilibria
• The speed of convergence in congestion games under best-response dynamics
• Convergence to approximate Nash equilibria in congestion games
• The Speed of Convergence in Congestion Games under Best-Response Dynamics

Cited in

(26)

• A note on the convergence of transfer sequences in \(n\)-person games
• Non-atomic one-round walks in congestion games
• The convergence of equilibrium strategies of approximating signaling games
• Dynamics in network interaction games
• Strategic multiway cut and multicut games
• Designing fast converging cost sharing methods for multicast transmissions
• Efficient coordination mechanisms for unrelated machine scheduling
• On the convergence of multicast games in directed networks
• On the performance of mildly greedy players in cut games
• Computing Stable Outcomes in Hedonic Games
• On the performance of mildly greedy players in cut games
• Potential games and well-posedness properties
• scientific article; zbMATH DE number 1054809 (Why is no real title available?)
• Convergence and approximation in potential games
• Dynamics of Profit-Sharing Games
• Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness
• Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Atomic Congestion Games: Fast, Myopic and Concurrent
• Graphical congestion games
• Tight bounds for selfish and greedy load balancing
• Performance of one-round walks in linear congestion games
• On best response dynamics in weighted congestion games with polynomial delays
• A contraction principle for finite global games
• Minimizing expectation plus variance
• Variational convergence: approximation and existence of equilibria in discontinuous games

This page was built for publication: Convergence and Approximation in Potential Games

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