In the following infinite game, Alice and John take turns moving. First, Alice picks a closed interval I<sub>1</sub> of length <1. Then, Bob picks a closed subinterval I<sub>2</sub> which is a subset of or equal to I<sub>1</sub>, of length 1/2.
Next, Alice picks a closed subinterval I<sub>3</sub> which is a subset of or equal to I<sub>2</sub>. The game continues in this way for infinitely many turns. At the endof the game, Alice and Bob have thus picked a sequence of intervals ...(subset of or equal to)I<sub>3</sub>(subset of or equal to)I<sub>2</sub>(subset of or equal to)I<sub>1</sub>, whose intersection consists of a single point x<sub>&infin</sub>
A referree examines x<sub>&infin</sub>. If it is rational, Alice wins. If it is irrational, Bob wins.
Does either Alice or bob have a winning strategy for the game; a rule by which Alice picks her intervals I1, I2, I3, etc, possibly depending on all the intervals previously chosen by both players, such that Alice wins the game no matter how Bob plays?
If there is a winning strategy for one player, give the strategy and prove how it works. If there is no winning strategy, explain why.
Note: Alice and Bob are not allowed to play intervals on length 0.
A Subset Game involving Intervals and Subintervals is investigated.