Publication:3549719
From MaRDI portal
zbMath1231.68146MaRDI QIDQ3549719
Berthold Vöcking, Alexander Skopalik
Publication date: 5 January 2009
91A10: Noncooperative games
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Convergence and approximation in potential games, Convergence to approximate Nash equilibria in congestion games, On the performance of approximate equilibria in congestion games, Performance of one-round walks in linear congestion games, On best response dynamics in weighted congestion games with polynomial delays, The impact of social ignorance on weighted congestion games, Competitive routing over time, Computing equilibria: a computational complexity perspective, Computing approximate Nash equilibria in network congestion games, Computing Approximate Nash Equilibria in Network Congestion Games