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
Computing equilibria: a computational complexity perspective, Computing Approximate Nash Equilibria in Network Congestion Games
