Reachability Switching Games
We study the problem of deciding the winner of reachability switching games for zero-, one-, and two-player variants. Switching games provide a deterministic analogue of stochastic games. We show that the zero-player case is NL-hard, the one-player case is NP-complete, and that the two-player case i...
| 主要な著者: | , , , |
|---|---|
| フォーマット: | 論文 |
| 言語: | English |
| 出版事項: |
Logical Methods in Computer Science e.V.
2021-04-01
|
| シリーズ: | Logical Methods in Computer Science |
| 主題: | |
| オンライン･アクセス: | https://lmcs.episciences.org/5425/pdf |