Algorithms – ESA 2005

DOI10.1007/11561071zbMath1162.91306OpenAlexW2501059503MaRDI QIDQ5475820

Constantinos Daskalakis, Christos H. Papadimitriou

Publication date: 27 June 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Games involving graphs (91A43)

Related Items (10)

Some results of Maria Serna on strategic games: complexity of equilibria and models ⋮ Computing equilibria: a computational complexity perspective ⋮ Weighted Boolean Formula Games ⋮ The communication complexity of graphical games on grid graphs ⋮ Equilibria of graphical games with symmetries ⋮ Parameterized two-player Nash equilibrium ⋮ Equilibria problems on games: complexity versus succinctness ⋮ Well supported approximate equilibria in bimatrix games ⋮ Nash stability in additively separable hedonic games and community structures ⋮ Estimation of the complexity of the potential transformation algorithm for solving cyclic games on graphs

This page was built for publication: Algorithms – ESA 2005