1. Suppose that R and C play a game by matching coins. On each play, C pays R the number of heads shown (0, 1, or 2) minus twice the number of tails shown.
2. In the children's game Scissors Paper Stone, each of two children calls out one of the three words. If they both call out the same word, then the game is a tie. Otherwise, "scissors" beats "paper" (since scissors can cut paper), "paper" beats "stone" (since paper can cover stone), and "stone" beats "scissors" (since stone can break scissors). Suppose that the loser pays a penny to the winner.
For each of the games that follow, give the payoff matrix and decide whether the game is strictly determined. For those that are, determine the optimal strategies for R and C?