Convergence and Approximation in Potential Games

DOI10.1007/11672142_28zbMath1136.91341OpenAlexW2117935782MaRDI QIDQ5449812

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)

Related Items (17)

Computing Stable Outcomes in Hedonic Games ⋮ Efficient coordination mechanisms for unrelated machine scheduling ⋮ On the convergence of multicast games in directed networks ⋮ Dynamics in network interaction games ⋮ Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games ⋮ Minimizing expectation plus variance ⋮ Strategic multiway cut and multicut games ⋮ Graphical congestion games ⋮ Convergence and approximation in potential games ⋮ Tight bounds for selfish and greedy load balancing ⋮ Designing fast converging cost sharing methods for multicast transmissions ⋮ Performance of one-round walks in linear congestion games ⋮ On best response dynamics in weighted congestion games with polynomial delays ⋮ Non-atomic one-round walks in congestion games ⋮ Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness ⋮ Atomic Congestion Games: Fast, Myopic and Concurrent ⋮ Dynamics of Profit-Sharing Games

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