Convergence and Approximation in Potential Games
From MaRDI portal
Publication:5449812
DOI10.1007/11672142_28zbMath1136.91341MaRDI 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
91A43: Games involving graphs
Related Items
Dynamics of Profit-Sharing Games, Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games, Atomic Congestion Games: Fast, Myopic and Concurrent, Convergence and approximation in potential games, Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness, 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, Minimizing expectation plus variance, Non-atomic one-round walks in congestion 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, Computing Stable Outcomes in Hedonic Games
