On the Complexity of Equilibria Problems in Angel-Daemon Games
From MaRDI portal
Publication:3511310
Recommendations
Cites work
- A course in game theory.
- Algorithmic Game Theory
- Algorithms and Computation
- Fault Tolerant Implementation
- scientific article; zbMATH DE number 561553 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 719756 (Why is no real title available?)
- scientific article; zbMATH DE number 784042 (Why is no real title available?)
- scientific article; zbMATH DE number 2243403 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- Mathematical Foundations of Computer Science 2005
- On the complexity of succinct zero-sum games
- The Computational Complexity of Nash Equilibria in Concisely Represented Games
- When selfish meets evil, Byzantine players in a virus inoculation game
Cited in
(2)
This page was built for publication: On the Complexity of Equilibria Problems in Angel-Daemon Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511310)