Mathematical Foundations of Computer Science 2005

DOI10.1007/11549345zbMath1156.91308OpenAlexW2494705596MaRDI 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

zbMATH Keywords

Strategic games, Nash equilibria, complexity classes.

Mathematics Subject Classification ID

Noncooperative games (91A10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (6)

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 ⋮ On the Complexity of Equilibria Problems in Angel-Daemon Games ⋮ Equilibria problems on games: complexity versus succinctness ⋮ Pairwise-Interaction Games

This page was built for publication: Mathematical Foundations of Computer Science 2005