Minkowski games

DOI10.1145/3230741MaRDI QIDQ4691739zbMATH OpenOpenAlexWikidataFDO

Authors Stéphane Le Roux, Arno Pauly, Jean-François Raskin

Publication date 24 October 2018

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL https://cronfa.swan.ac.uk/Record/cronfa40809/Download/0040809-25062018135152.pdf

zbMATH Keywords

coNP-completeundecidablecontrol in \(\mathbb{R}^d\)polytopic/arbitrary(stochastic) determinacy

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games involving topology, set theory, or logic (91A44)

Recommendations

• scientific article; zbMATH DE number 6862142
• Entropy Games and Matrix Multiplication Games
• Mathematical Foundations of Computer Science 2005
• On the complexity of counter reachability games
• Banach-Mazur games on graphs

Cited in

(5)

• Rothberger property and related games
• On decidability and complexity of low-dimensional robot games
• Games with bound guess actions
• Gentzen Games
• scientific article; zbMATH DE number 6862142 (Why is no real title available?)

This page was built for publication: Minkowski games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4691739)