Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/minkowski-games-uH0E994YMW
References (39)
-
T. Henzinger, P. Kopke (1997)
Discrete-Time Control for Rectangular Hybrid AutomataTheor. Comput. Sci., 221
-
M. Schröder (2007)
Admissible representations for probability measuresMathematical Logic Quarterly, 53
-
M. Minsky (1961)
Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing MachinesAnnals of Mathematics, 74
-
Solomon Feferman (2006)
Tarski’s influence on computer scienceLogic. Methods Comput. Sci., 2
-
(2017)
Minkowski games -
M. Fischer, M. Rabin (1974)
SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC -
P. Wolfe (1955)
The strict determinateness of certain infinite gamePacific Journal of Mathematics, 5
-
(1953)
Infinite games with perfect information -
S. Feferman (2005)
Tarski's influence on computer science20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05)
-
(2016)
Absorbing convex hull into Minkowski sum. Mathematics Stack Exchange -
Christian Knauer, Stefan König, Daniel Werner (2013)
Fixed-Parameter Complexity and Approximability of Norm MaximizationDiscrete & Computational Geometry, 53
-
(2013)
Research Report LSV-13-02. Laboratoire Spécification et Vérification -
Thomas A. Henzinger, Peter W. Kopke (1997)
Discrete-time control for rectangular hybrid automataProceedings of the 24th International Colloquium on Automata
-
T. Henzinger, Benjamin Horowitz, R. Majumdar (1999)
Rectangular Hybrid Games -
(1995)
Martin . Borel determinacy -
C. Papadimitriou (1981)
On the complexity of integer programmingJ. ACM, 28
-
K. Weihrauch (2014)
Computable Analysis: An IntroductionComputable Analysis
-
P. Giannopoulos, Christian Knauer, G. Rote (2009)
The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension -
R. Niskanen, I. Potapov, J. Reichert (2016)
Undecidability of Two-dimensional Robot Games -
Stefan Szeider (1998)
Parameterized Complexity -
R. Alur, Ashutosh Trivedi, D. Wojtczak (2012)
Optimal scheduling for constant-rate multi-mode systems -
Stéphane Roux, A. Pauly (2013)
Finite choice, convex choice and finding rootsLogical Methods in Computer Science, 11
-
A. Pauly, W. Fouché (2014)
How constructive is constructing measures?ArXiv, abs/1409.3428
-
M. Ziegler (2004)
Computable operators on regular setsMathematical Logic Quarterly, 50
-
Oded Maler, Amir Pnueli, Joseph Sifakis (1995)
On the Synthesis of Discrete Controllers for Timed SystemsSpringer
-
K. Weihrauch (2005)
Computable Analysis -
M. Jurdzinski, R. Lazic, S. Schmitz (2015)
Fixed-Dimensional Energy Games are in Pseudo-Polynomial TimeArXiv, abs/1502.06875
-
B. Chazelle (1993)
An optimal convex hull algorithm in any fixed dimensionDiscrete & Computational Geometry, 10
-
D. Dobkin, S. Reiss (1980)
The Complexity of Linear ProgrammingTheor. Comput. Sci., 11
-
K. Chatterjee, L. Doyen, T. Henzinger, Jean-François Raskin (2010)
Generalized Mean-payoff and Energy GamesArXiv, abs/1007.1669
-
A. Pnueli, Roni Rosner (1989)
On the synthesis of a reactive module -
O. Maler, A. Pnueli, J. Sifakis (1995)
On the Synthesis of Discrete Controllers for Timed Systems (An Extended Abstract) -
L. Doyen, A. Rabinovich (2011)
Robot Games -
R. Alur, Vojtěch Forejt, Salar Moarref, Ashutosh Trivedi (2013)
Safe schedulability of bounded-rate multi-mode systemsArXiv, abs/1302.0745
-
Donald A. Martin (1975)
Borel determinacyAnn. Math., 102
-
user (2016)
Absorbing convex hull into Minkowski sumMathematics Stack Exchange. Retrieved from https://math.stackexchange.com/q/1814457.
-
J. Davenport, J. Heintz (1988)
Real Quantifier Elimination is Doubly ExponentialJ. Symb. Comput., 5
-
M. Ben-Or, D. Kozen, J. Reif (1984)
The complexity of elementary algebra and geometryJ. Comput. Syst. Sci., 32
-
A. Pauly (2012)
On the topological aspects of the theory of represented spacesComput., 5
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 2018 ACM
- ISSN
- 1529-3785
- eISSN
- 1557-945X
- DOI
- 10.1145/3230741
- Publisher site
- See Article on Publisher Site
Abstract
We introduce and study Minkowski games. These are two-player games, where the players take turns to choose positions in R<sup<d</sup< based on some rules. Variants include boundedness games, where one player wants to keep the positions bounded, and the other wants to escape to infinity; as well as safety games, where one player wants to stay within a prescribed 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.
Journal
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Aug 30, 2018
Keywords: (stochastic) determinacy