0
votes
1answer
100 views

Consider a game in which two players take turns removing any positive number of pebbles they want from one of two piles of pebbles.

Consider a game in which two players take turns removing any positive number of pebbles they want from one of two piles of pebbles. The player who removes the last pebble wins the game. Show that if ...
1
vote
1answer
63 views

Question on the use of induction in the Electronic Mail Game

In Rubinstein's Electronic Mail Game, Player I and Player II's strategies take the form as $s_i : \mathbb{N} \to \{A,B\}$, $(i =1,2)$. Rubinstein shows that the pair of constant functions, $s_1(t_1) ...
0
votes
1answer
797 views

Simple Nim game with equal-sized piles.

Consider the standard Nim game, i.e. you can take as many coins as you want from a single pile, you should take at least one coin and you can't take coins from two or more different piles at the same ...