On the Complexity of Equilibria Problems in Angel-Daemon Games
From MaRDI portal
Publication:3511310
DOI10.1007/978-3-540-69733-6_4zbMath1148.91301MaRDI QIDQ3511310
Joaquim Gabarró, Alina García, Maria J. Serna
Publication date: 10 July 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69733-6_4
91A10: Noncooperative games
91A80: Applications of game theory
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of succinct zero-sum games
- The Computational Complexity of Nash Equilibria in Concisely Represented Games
- Fault Tolerant Implementation
- When selfish meets evil
- Algorithmic Game Theory
- Mathematical Foundations of Computer Science 2005
- Algorithms and Computation