The complexity of robot games on the integer line

MaRDI QIDQ4992530zbMATH OpenFDO

Authors Arjun Arul, J. Reichert

Publication date 9 June 2021

Full work available at URL https://arxiv.org/abs/1301.7700, http://eptcs.web.cse.unsw.edu.au/paper.cgi?QAPL2013.9

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Combinatorial games (91A46) Algorithmic game theory and complexity (91A68)

Recommendations

• On decidability and complexity of low-dimensional robot games
• Robot games with states in dimension one
• On robot games of degree two
• Undecidability of two-dimensional robot games
• On the complexity of counter reachability games

Cited in

(8)

• Robot games with states in dimension one
• Ice sliding games
• On decidability and complexity of low-dimensional robot games
• Weighted automata on infinite words in the context of attacker-defender games
• On robot games of degree two
• Weighted automata on infinite words in the context of attacker-defender games
• Undecidability of two-dimensional robot games
• Quantitative aspects of programming languages and systems over the past 2⁴ years and beyond

This page was built for publication: The complexity of robot games on the integer line

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