Section 3.5 Liar’s Poker
In this section, we will continue to explore the ideas of a mixed strategy equilibrium. We have seen several examples of finding an equilibrium. We began with games which had a pure strategy equilibrium and then moved to games with a mixed strategy equilibrium. We saw two different methods for finding an equilibrium. The first employed graphs in order to understand and find the maximin and minimax strategies, and hence the equilibrium mixed strategy. The second method employed the ideas of expected value to find the equilibrium strategy. We will continue to solidify these ideas with another game, a simplified variation of poker.
Example 3.5.1. Liar’s Poker.
We begin with a deck of cards which has 50% Aces (A) and 50% Kings (K) and two players. Aces rank higher than Kings.
Player 1 is dealt one card, face down. Player 1 can look at the card, but does not show the card to Player 2. Player 1 then says “Ace” or “King” depending on what his card is. Player 1 can either tell the truth and say what the card is (T), or he can bluff and say that he has a higher ranking card (B). Note that if Player 1 has an Ace, he must tell the truth since there are no higher ranking cards. However, if he is dealt a King, he can bluff by saying he has an Ace.
If Player 1 says “King” the game ends and both players break even. If Player 1 says “Ace” then Player 2 can either call (C) or fold (F). If Player 2 folds, then Player 1 wins $0.50. If Player 2 calls and Player 1 does not have an Ace, then Player 2 wins $1. If Player 2 calls and Player 1 does have an Ace, then Player 1 wins $1.
Activity 3.5.1. Play Liar’s Poker.
Choose an opponent and play Liar’s Poker several times. Be sure to play the game as Player 1 and as Player 2. This is important for understanding the game. Keep track of the outcomes.
Activity 3.5.2. Conjecture a strategy.
Just from playing Liar’s Poker several times, can you suggest a strategy for Player 1? What about for Player 2? Does this game seem fair, or does one of the players seem to have an advantage? Explain your answers.
Activity 3.5.3. Try to find the payoff matrix.
In order to formally analyze Liar’s Poker, we should find the payoff matrix. Do your best to find the payoff matrix. In a single hand of Liar’s Poker, what are the possible strategies for Player 1? What are the possible strategies for Player 2? Determine any payoffs that you can.
Finding the payoff matrix in
Activity 3.5.3 is probably more challenging than it appears. Eventually we want to employ the same method for finding the payoff matrix that we used in One-Card Stud Poker from
Example 2.4.1 in Chapter 2, but first we need to understand each player’s strategies and the resulting payoffs. We begin with the fact that Player 1 can be dealt an Ace or a King.
Activity 3.5.4. Player 1 has an Ace.
Assume Player 1 is dealt an Ace. What can Player 1 do? What can Player 2 do? What is the payoff for each situation?
Activity 3.5.5. Player 1 has a King.
Assume Player 1 is dealt a King. What can Player 1 do? What can Player 2 do? What is the payoff for each situation?
Since Player 1 must say “Ace” when dealt an Ace, he only has a choice of strategy when dealt a King. So we can define his strategy independent of the deal. One strategy is to say “Ace” when dealt an Ace and say “Ace” when dealt a King; call this the bluffing strategy, (B). The other strategy is to say “Ace” when dealt an Ace and say “King” when dealt a King; call this the truth strategy, (T). The only time Player 2 has a choice is when Player 1 says “Ace.” In this case Player 2 can call, (C) or fold, (F). Since we need to determine the payoff matrix, we first need to determine the payoffs for pure strategies. This is similar to what we did for the One-Card Stud game.
Activity 3.5.6. Expected value of [B, C].
Consider Player 1’s pure strategy of always bluffing when dealt a King (B) and Player 2’s pure strategy of always calling (C). Determine the expected value for Player 1. What is Player 2’s expected value?
Hint.
You need to consider each possible deal.
Activity 3.5.7. Expected value of [B, F].
Similarly, determine the expected value for Player 1 for the pure strategy pair [B, F]. What is Player 2’s expected value?
Activity 3.5.8. Expected value of [T, C].
Determine the expected value for Player 1 for the pure strategy pair [T, C]. What is Player 2’s expected value?
Activity 3.5.9. Expected value of [T, F].
Determine the expected value for Player 1 for the pure strategy pair [T, F]. What is Player 2’s expected value?
Activity 3.5.10. Payoff matrix for Liar’s Poker.
Once you have determined the payoff matrix for Liar’s Poker, you can use either the graphical method or expected value method to solve the game. But before using either of these methods always check for a pure strategy equilibrium!
Activity 3.5.11. Pure strategy equilibrium.
Using the payoff matrix you found in
Activity 3.5.10, does Liar’s Poker have a pure strategy equilibrium? Explain.
Activity 3.5.12. Mixed strategy equilibrium.
Use any method you have learned to find a mixed strategy equilibrium for Liar’s Poker. Give the mixed strategy for Player 1 and the mixed strategy for Player 2.
Activity 3.5.13. Compare strategies.
Activity 3.5.14. Expected value of the game.
What is the expected value of the game for each player? How much would Player 1 expect to win if she played 15 games using the equilibrium mixed strategy?
Activity 3.5.15. Fairness.
Is this game fair? Explain. Again, compare your answer to your conjecture in
Activity 3.5.2.
Congratulations! You can now set up matrices for simple games of chance and solve for a mixed strategy equilibrium. Before solving a more complicated game, let’s get the help of technology for solving larger matrix games.
Reading Questions Check Your Understanding
1.
Match each payoff vector to the corresponding strategy pair for Liar’s Poker,
Example 3.5.1.
- [B, C]
- \((0, 0)\)
- [B, F]
- \((1/2, -1/2)\)
- [T, F]
- \((1/4, -1/4)\)
2.
In Liar’s Poker, the payoff vector for [T, C] is
- \((0, 0)\)
-
- \((1/2, -1/2).\)
-
- \((-1/2, 1/2).\)
-
- \((-1/4, 1/4).\)
-
- \((1/4, -1/4).\)
-
3.
In Liar’s Poker, it is preferable to be
Player 1
Correct. Player 1 has expected payoffs greater than or equal to 0.
Player 2
Incorrect. Player 2 has expected payoffs less than or equal to 0.
Neither, the game looks the same to both players.
Incorrect. Player 1’s expected payoffs are greater than or equal to 0, while Player 2’s expected payoffs less than or equal to 0.
4.
True or False: In the game of Liar’s Poker, Player 1 should always bluff (B).
True.
The payoff matrix is helpful.
False.
The payoff matrix is helpful.
5.
True or False: In the game of Liar’s Poker, Player 2 should always call (C).
True.
The payoff matrix is helpful.
False.
The payoff matrix is helpful.
6.
True or False: In the game of Liar’s Poker, Player 1 should tell the truth (T) more often than bluff (B).
True.
False.
7.
True or False: In the game of Liar’s Poker, Player 2 should fold (F) more often than call (C).
True.
False.
8.
9.
10.
If Player 2 plays the (1/2, 1/2) mixed strategy in Liar’s Poker, then which pure strategy does Player 1 prefer?
Bluffing (B)
Use the expected values of each pure strategy to help you.
Telling the truth (T)
Since the expected value for Player 1 is greater for T than B, Player 1 prefers T.
Neither, Player 1 is indifferent to playing B or T.
Use the expected values of each pure strategy to help you.
11.
True or False: If Liar’s Poker is played once (not repeated), Player 1 will win.
True.
Although the expected payoff is positive, we don’t know what will happen for any one time the game is played.
False.
Although the expected payoff is positive, we don’t know what will happen for any one time the game is played.
12.
True or False: If Liar’s Poker is played 10 times with Player 1 playing the mixed strategy equilibrium, then Player 1 expects to have a positive payoff.
True.
Since the expected payoff is positive for the mixed strategy equilibrium, Player 1 expects a positive payoff in the long run.
False.
Since the expected payoff is positive for the mixed strategy equilibrium, Player 1 expects a positive payoff in the long run.
