Minkowski Games
Stéphane Le Roux, Arno Pauly, Jean-François Raskin · ACM Transactions on Computational Logic · 2018
We introduce and study Minkowski games. These are two-player games, where the players take turns to choose positions in R We provide some general characterizations of which player can win such games and explore the computational complexity of the associated decision problems. A natural representation of boundedness games yields coNP-completeness, whereas the safety games are undecidable.