Solve the two-finger Morra game introduced at the beginning of this section.

Data from two-finger Morra game

Transcribed Image Text:

Nonstrictly Determined Games: Example Now we consider some interesting nonstrictly determined games. As before, we start with an example and generalize from our observations. There are many variations of the two-finger Morra game. Basically, the game involves two players who simultaneously show one or two fingers and agree to a payoff for each particular combined outcome. Let us consider the following variation of the game, where the payoff (in dollars) is the sum of the fingers to R if the sum is even and the sum of the fingers to C if the sum is odd: Player R 1 finger 2 fingers Player C 1 finger 2 fingers 2-3 Would you rather be a row player or a column player, or does it matter? (Think about this for a moment before proceeding.) To answer this question, start by checking to see whether the game is strictly determined. Using the circle and square method described in the preceding section, we have Since no payoff has both a circle and a square around it, there is no saddle value; hence, the game is not strictly determined. How should the players play? If player R continued to play row 2 (because of the $4 payoff), it would not take C long to detect R's strategy, and C would obviously play column 1. Then R would play row 1 and C would have to shift to column 2, and so on. It appears that neither