Reachability games and related matrix and word problems

R Niskanen
In this thesis, we study different two-player zero-sum games, where one player, called Eve, has a reachability objective (i.e., aims to reach a particular configuration) and the other, called Adam, has a safety objective (i.e., aims to avoid the configuration). We study a general class of games, called Attacker-Defender games, where the computational environment can vary from as simple as the integer line to n-dimensional topological braids. Similarly, the moves themselves can be simple vector...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.