LATIN 2004: Theoretical Informatics
From MaRDI portal
Publication:5901661
DOI10.1007/b95852zbMath1196.91012OpenAlexW2475444492MaRDI QIDQ5901661
Richard J. Lipton, Evangelos Markakis
Publication date: 7 May 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95852
Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) (n)-person games, (n>2) (91A06)
Related Items (7)
On the complexity of constrained Nash equilibria in graphical games ⋮ On the reduction of multivariate quadratic systems to best rank-1 approximation of three-way tensors ⋮ Correlated equilibria in continuous games: characterization and computation ⋮ Semidefinite programming for min-max problems and games ⋮ Algorithmic rationality: game theory with costly computation ⋮ Mixed Nash equilibria in selfish routing problems with dynamic constraints ⋮ A parametric representation of totally mixed Nash equilibria
This page was built for publication: LATIN 2004: Theoretical Informatics