Question

In: Economics

The diner and the waiter play a sequential game. The waiter decides whether to give good...

The diner and the waiter play a sequential game. The waiter decides whether to give good service or not: the diner then decides, in each case, whether to leave a $4 tip. If there is bad service and no tip, each gets a payoff of 0. Good service is worth $6 to the diner and costs the waiter $2. So if there is good service and a tip, the diner gets a payoff of 6-4 = 2 and the waiter a payoff of 4-2 = 2, for example.

a) What is the unique sub-game perfect equilibrium of this game. Why?

b) Explain how infinite repetition makes it impossible for tipping to occur. Construct an equilibrium where this happens.

c) Use an analogue of the Grim Trigger and find what conditions on d( =1/(1+r)) allow such an equilibrium to work. Explain your work.

d) Now suppose that with probability 1-p in each period the game will end after this period - the waiter will get a job as an actor. Now? what conditions on d are necessary.

Solutions

Expert Solution

a) Payoff matrix for a game is attached herewith

Sub-game perfect equilibrium or Nash equilibrium is cooperation state (2,2) as in this state, both are better off. Other states are implications of deciding to defect.

Every finite extensive game has a subgame perfect equilibrium

b) Nash equilibrium is good service and tipping. However, in an infinitely repeated game (as life is not infinite, infinite repeatation meaning the probability of event recurring p at every sequence).

However, payoffs for waiter are -2,0,2,4. Considering 1/4 probability of each state, waiter has a better pay off by not serving and 0 payoff by serving good (refer the payoff matrix). Waiters payoff for bad service is 0,4 and for good service is -2,2. Similarly, payoff for Diner for no tip (0,6) is higher than payoff for tip (-4,2). Therefore, both players are incentivized to defect than to cooperate. Cooperating is best social stragegy however, individual players have better payoffs in non-cooperation.

Now considering the dicounting to be D, players woulHence, infinite repetetions would incentivize both the players to defect once, to take advantage of higher payoffs. Once, either player has defected, this will enabled that both players will always defect in all future games.

c)

For diner, he would defect, only if payoff in defect is higher than payoff in cooperation

6 + 0*d/(1-d) > = 2/(1-d)

==> 6/2 >= 1/(1-d)

==> 1/3 <= 1-d

==> d <= 2/3

Not defect if d >=2/3

Similarly, Waiter will defect, only if

4 + 0*d/(1-d) > 2/(1-d)

==> 1/2 <= 1-d ==> d <= 1/2

Not defect if d >= 1/2

Therefore, for both diner & waiter to not defect, d should be greater than or equal to 2 / 3

d) p probability that game will not end, therefore player will not defect. (1-p) probability that the game will end, therefore the player will defect.

Therefore, for the equilibrium to work:

payoff of defecting should be less than payoff of not defecting.

Hence, 2/(1-d)*p >= (1-p)*[4+0*d/(1-d)]

==> 2p/(1-d) >= 4*(1-p)

==> p/2*(1-p) >= 1-d

==> d >= 1 - p/(2-2p)

This is the condition for d in terms of p.


Related Solutions

This is a sequential game with two players A and B. In this game a dime...
This is a sequential game with two players A and B. In this game a dime is put on the table. A can take it or pass. If A takes a dime, the game ends; if A passes, then B can take 2 dimes or pass; if B takes 2 dimes, the game ends; if B passes, then A can take 3 dimes or pass; and so on until a choice of a dollar. This process is shown in the...
Frank Ocean decides to play roulette. This game is attractive because the house advantage is small....
Frank Ocean decides to play roulette. This game is attractive because the house advantage is small. If Frank plays and wins big, which of the following is true? a. Frank is a risk taker b. Frank is risk averse c. Frank is a risk neutral d. Frank is a risk-free player
What is the subgame perfect equilibrium outcome for this sequential game?
A challenger (Firm 2) is considering entry into the local phone market in the Bay Area. The incumbent (Firm 1), predicts that a price war will result if Firm 2 enters. If Firm 2 stays out, Firm 1 earns monopoly profits valued at $10 million (net present value, or NPV of profits), while Firm 2 earns zero. If Firm 2 enters, it must incur irreversible entry costs of $2 million. If there is a price war, each firm earns $1...
IN C++ Write a program to play the Card Guessing Game. Your program must give the...
IN C++ Write a program to play the Card Guessing Game. Your program must give the user the following choices: - Guess only the face value of the card. -Guess only the suit of the card. -Guess both the face value and suit of the card. Before the start of the game, create a deck of cards. Before each guess, use the function random_shuffle to randomly shuffle the deck.
A video game designer decides to include a character in a new game that only moves...
A video game designer decides to include a character in a new game that only moves along a parabolic path. The designer uses the function x²+50+10 to model this character’s path, where y is the height of the character in pixels and x is the time in seconds that it takes the character to move across one parabolic path. a. Is the vertex of the function a maximum or minimum point and how can you tell? b. Find the x-coordinate...
Two players play a rock-paper-scissors game. The losing player will give $1 to the winning player....
Two players play a rock-paper-scissors game. The losing player will give $1 to the winning player. If it is a draw, no payment is made. The payoff to a player is the amount of money (s)he gets. Represent the situation in a matrix form. Find all the Nash equilibria.
import random play = True while play:       #create a new game if play is True...
import random play = True while play:       #create a new game if play is True    turn = 0    remaining_coins = random.randint(20, 30)   #randomly generate coins between 20 to 30    print("Take turns removing 1, 2, or 3 coins,")    print("You win if you take the last coin.")    while remaining_coins > 0:       #loop until remaining_coins exist        print("\nThere are", remaining_coins, "coins remaining. ")        if turn % 2 == 0:                  ...
In the sequential bargaining game with ∞ <T rounds where player 1 is the first proposer...
In the sequential bargaining game with ∞ <T rounds where player 1 is the first proposer and if the player 2 rejects the offer, the game goes to the second round where they switch roles (the payoff is (s, 1-s) if responder accepts the offer) how do I find the followings? 1. A Nash Equilibrium that is not a SPE. 2. Nash Equilibrium which is different from the first question and which offers the highest possible payoff to the second...
The probability of winning on an arcade game is 0.678. If you play the arcade game...
The probability of winning on an arcade game is 0.678. If you play the arcade game 24 times, what is the probability of winning no more than 12 times? (Round your answer to 3 decimal places, if necessary.)
A game of chance offers the following odds and payoffs. Each play of the game costs...
A game of chance offers the following odds and payoffs. Each play of the game costs $100, so the net profit per play is the payoff less $100. Probability Payoff Net Profit 0.10 $700 $600 0.50 100 0 0.40 0 –100 a-1. What is the expected cash payoff? (Round your answer to the nearest whole dollar amount.) a-2. What is the expected rate of return? (Enter your answer as a percent rounded to the nearest whole number.) b-1. What is...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT