| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6876009 | Theoretical Computer Science | 2015 | 11 Pages |
Abstract
We also study a localized version of the discrete MBP: the adversary has a location within the graph and must act locally (filling cups) with respect to his position, just as the player acts locally (emptying cups) with respect to her position. We prove that deciding the value of this game is PSPACE-hard.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Michael A. Bender, Sándor P. Fekete, Alexander Kröller, Vincenzo Liberatore, Joseph S.B. Mitchell, Valentin Polishchuk, Jukka Suomela,