• Citer

Minkowski games

par Le Roux, Stephane ;Pauly, Arno ;Raskin, Jean-François
Référence Leibniz international proceedings in informatics, 66, 50
Publication Publié, 2017-03

Article révisé par les pairs

• Détails
• Contenu

Résumé :

We introduce and study Minkowski games. In these games, two players take turns to choose positions in ℝd based on some rules. Variants include boundedness games, where one player wants to keep the positions bounded (while the other wants to escape to infinity), and safety games, where one player wants to stay within a given set (while the other wants to leave it). 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.