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...
| Những tác giả chính: | , , , |
|---|---|
| Định dạng: | Bài viết |
| Ngôn ngữ: | English |
| Được phát hành: |
Logical Methods in Computer Science e.V.
2021-04-01
|
| Loạt: | Logical Methods in Computer Science |
| Những chủ đề: | |
| Truy cập trực tuyến: | https://lmcs.episciences.org/5425/pdf |