We consider a variety of two person perfect information games of the following sort. On the ith round Player I selects a vector vi of a certain prescribed form and Player II either adds or subtracts vi from a cumulative sum. Player II's object is to keep the cumulative sum as small as possible. We give bounds on the value of such games under a variety of conditions.
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics