Question

In: Economics

Consider the following game, which might model the “Split-or-Steal” game show. Two players simultaneously choose whether...

Consider the following game, which might model the “Split-or-Steal” game show. Two players simultaneously choose whether to split or steal. If they each choose to split, they each get $50. If one chooses steal and the other chooses split, then the stealer gets $100 and the splitter gets $0. If both choose steal, they each get $0.

(a) Assume the players care both about their own monetary earnings and the amount of inequality between their earnings: for a pair of actions (a1, a2) that results in monetary payoffs of $x and $y to players 1 and 2 respectively, player 1’s payoff is 3x − 2|x − y| and player 2’s payoff is 3y − 2|x − y|. For example, when one player chooses split and the other chooses steal, the payoff for the player who chooses split is −200。Represent the game with a payoff matrix.

(b) What is player 1’s best response if player 2 chooses steal? What is player 1’s best response if player 2 chooses split?

Solutions

Expert Solution

This game is very easy to present in the form of a payoff matrix. Payoffs for the players differs from their monetary earnings because they also care about the amount of inequality between their earnings, as mentioned. Thus, let's first calculate the payoffs under different circumstances:

If player 1 chooses to split and player 2 also chooses to split, player 1's payoff = 3(50) - 2|50 - 50| = 150.

If player 1 chooses to steal and player 2 chooses to split, player 1's payoff = 3(100) - 2|100 - 0| = 100

If player 1 chooses to split and player 2 chooses to steal, player 1's payoff = 3(0) - 2|0 - 100| = -200

If player 1 chooses to steal and player 2 chooses to steal, player 1's payoff = 3(0) - 2|0 -0| = 0

The same holds for player 2, as his payoff function is identical to player 1's payoff function. The payoff matrix for this game is given below:

(a)

Player 2 Splits Player 2 Steals
Player 1 Splits (150, 150) (-200, 100)
Player 1 Steals (100, -200) (0, 0)

(b) From the matrix above, we can see that if player 2 chooses to steal, player 1's best response is to play "steal", since this strategy minimizes its loss ( 0 > -200)

If player 2 chooses to split the money, player 1's best response is to play "split", since this strategy maximizes its payoff (150 > 100).


Related Solutions

Q1. Consider the following game. Two players simultaneously and independently choose one of three venues. They...
Q1. Consider the following game. Two players simultaneously and independently choose one of three venues. They would like to choose the same venue (i.e. meet), but their favorite venues are different: Football cafe ballet Football (3,2) (1,0) (1,1) cafe (0,0) (2,2) (0,1) ballet (0,0) (0,0) (2,3) a. What are the pure-strategy Nash equilibria of this game? b. Derive a mixed-strategy Nash equilibrium in which players 1 and 2 mix over Football and Cafe only? Now suppose that player 1 is...
In the game Rock Paper Scissors, two players simultaneously choose one of three options: rock, paper,...
In the game Rock Paper Scissors, two players simultaneously choose one of three options: rock, paper, or scissors. If both players choose the same option, then the result is a tie. However, if they choose differently, the winner is determined as follows: • Rock beats scissors, because a rock can break a pair of scissors. • Scissors beats paper, because scissors can cut paper. • Paper beats rock, because a piece of paper can cover a rock. Create a game...
In the game Rock Paper Scissors, two players simultaneously choose one of three options: rock, paper,...
In the game Rock Paper Scissors, two players simultaneously choose one of three options: rock, paper, or scissors. If both players choose the same option, then the result is a tie. However, if they choose differently, the winner is determined as follows: • Rock beats scissors, because a rock can break a pair of scissors. • Scissors beats paper, because scissors can cut paper. • Paper beats rock, because a piece of paper can cover a rock. Create a game...
1. Consider the following game. There are two piles of matches and two players. The game...
1. Consider the following game. There are two piles of matches and two players. The game starts with Player 1 and thereafter the players take turns. When it is a player's turn, she can remove any number of matches from either pile. Each player is required to remove some number of matches if either pile has matches remaining, and can only remove matches from one pile at a time. Whichever player removes the last match wins the game. Winning gives...
Consider a following zero-sum game of two players a) Reduce the initial game to a 2x2...
Consider a following zero-sum game of two players a) Reduce the initial game to a 2x2 game. Eliminate only strictly dominated strategies. In the obtained 2x2 game name Player 1’s (Row player’s) strategies “Up” and “Down” and Player 2’s (Column player’s) strategies “Left” and “Right”. b) Find all Nash equilibria of the 2x2 game (both in pure and mixed strategies) ALL ANSWERS MUST BE EXPLAINED. 2 0 1 -1 1 0 1 2 3 1 2 0
Consider a following zero-sum game of two players a) Reduce the initial game to a 2x2...
Consider a following zero-sum game of two players a) Reduce the initial game to a 2x2 game. Eliminate only strictly dominated strategies. In the obtained 2x2 game name Player 1’s (Row player’s) strategies “Up” and “Down” and Player 2’s (Column player’s) strategies “Left” and “Right”. b) Find all Nash equilibria of the 2x2 game (both in pure and mixed strategies) ALL ANSWERS MUST BE EXPLAINED. 2          0          1          -1 1          0          1          2 3...
Background: In the game “Rock, Paper, and Scissors,” two players simultaneously say (or display a hand...
Background: In the game “Rock, Paper, and Scissors,” two players simultaneously say (or display a hand symbol representing) either “rock,” “paper,” or “scissors.” The winner is the one whose choice wins over the other. The rules are: paper wins over (wraps) rock, rock wins over (breaks) scissors, and scissors wins over (cuts) paper. Assignment: A customer wants you to design and implement a program (RPS.py) for playing the game of “Rock, Paper, Scissors” for a single player against the computer....
Suppose that two players are playing the following game. Player 1 can choose either Top or...
Suppose that two players are playing the following game. Player 1 can choose either Top or Bottom, and Player 2 can choose either Left or Right. The payoffs are given in the following table: player 2: left right   player 1 : Top: (1,2) (2,4) bottom: (3,4) (0,3) where the number on the left is the payoff to Player 1, and the number on the right is the payoff to Player 2. A) (2 points) Does Player 1 have a dominant...
Suppose that two players are playing the following game. Player 1 can choose either Top or...
Suppose that two players are playing the following game. Player 1 can choose either Top or Bottom, and Player 2 can choose either Left or Right. The payoffs are given in the following table    Player 2 Player 1 Left Right Top 6 5 9 4 Bottom 7 4 5 3 where the number on the left is the payoff to Player A, and the number on the right is the payoff to Player B. A) (4 points) Does player...
Consider a game in which two players, Fred and Barney, take turns removing matchsticks from a...
Consider a game in which two players, Fred and Barney, take turns removing matchsticks from a pile. They start with 21 matchsticks, and Fred goes first. On each turn, each player may remove either one, two, or three matchsticks. The player to remove the last matchstick wins the game. (a) Suppose there are only 5 matchsticks left, and it is Fred’s turn. What move should Fred make to guarantee himself victory? Explain your reasoning. (b) Suppose there are 10 matchsticks...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT