The Complexity of Robot Games on the Integer Line
Logic in Computer Science
2013-08-05 v4 Computer Science and Game Theory
Abstract
In robot games on Z, two players add integers to a counter. Each player has a finite set from which he picks the integer to add, and the objective of the first player is to let the counter reach 0. We present an exponential-time algorithm for deciding the winner of a robot game given the initial counter value, and prove a matching lower bound.
Keywords
Cite
@article{arxiv.1301.7700,
title = {The Complexity of Robot Games on the Integer Line},
author = {Arjun Arul and Julien Reichert},
journal= {arXiv preprint arXiv:1301.7700},
year = {2013}
}
Comments
In Proceedings QAPL 2013, arXiv:1306.2413