Mathematical Foundations of Computer Science 2005
From MaRDI portal
Publication:5492850
DOI10.1007/11549345zbMath1156.91308MaRDI QIDQ5492850
Joaquim Gabarró, Carme Àlvarez, Maria J. Serna
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11549345
91A10: Noncooperative games
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Equilibria problems on games: complexity versus succinctness, Some results of Maria Serna on strategic games: complexity of equilibria and models, On the complexity of constrained Nash equilibria in graphical games, Simulating cardinal preferences in Boolean games: a proof technique, Pairwise-Interaction Games, On the Complexity of Equilibria Problems in Angel-Daemon Games