| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4950713 | Information and Computation | 2017 | 20 Pages |
Abstract
We present algorithms and complexity results for deciding the existence of doomsday equilibria for various classes of Ï-regular objectives, both for imperfect-information games, and for perfect-information games. We provide optimal complexity bounds for imperfect-information games, and in most cases for perfect-information games.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Krishnendu Chatterjee, Laurent Doyen, Emmanuel Filiot, Jean-François Raskin,