Question

Consider the case when a two-player zero-sum simultaneous game is converted to a sequential game in...

Consider the case when a two-player zero-sum simultaneous game is converted to a sequential game in which one player moves and then the other player moves, having observed the first player’s move. The second mover in such a game always does at least as well in any subgame-perfect equiibrium of the sequential game as in any Nash equilibrium of the simultaneous game. Is this true or false and explain why

Homework Answers

Answer #1

Yes, the statement is true.

Zero sum game is the one in which, with every set of stratergies, there is always a gain of one person and equal loss for the other person such that the total gain/loss is zero for the game.

For such a game, if sequential game is played, such that one player moves first and having observed first player's move, second player plays rationally as he /she would play in any nash equillibrium of the simultaneous game, then he/she would play the stratergy that would maximise his /her payoff. In such a situation with sequential games, the second player would be atleast as well as he/she was in Nash equilibrium of simultaneous game. For example:

In this game, simultaneously, there is no pure stratergy nash equilibrium, but given the sequential game, If player A choses 0, Player will be choosing 0, if A chooses 1, B would choose 1, thus Player B will be at least better off in sequential game.

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Consider the following version of the simultaneous-move stag-hunt game. S H S 9,9 0,8 H 8,0...
Consider the following version of the simultaneous-move stag-hunt game. S H S 9,9 0,8 H 8,0 7,7 (C)Suppose now that players move in sequence: player 1 moves first, and player 2 chooses his action after observing player 1’s action. Draw the extensive form of this game. Find its subgame perfect equilibrium.
Concerning a sequential move game, which of the following statements is true? The last decisions to...
Concerning a sequential move game, which of the following statements is true? The last decisions to be made must always be analyzed before moving onto the analysis of decisions occurring earlier in the game. Having a “First Mover Advantage” can occur if the ability of a player to make a credible commitment to an action is the most important advantage of the game. A “First Mover Advantage” may not occur in situations where a player’s ability to react to previous...
Is it possible that which player goes first in a sequential game can change what the...
Is it possible that which player goes first in a sequential game can change what the Nash equilibrium outcome is? In this particular game, why or why not? a. It is possible, since one player will prefer the simultaneous-game Nash b. It is possible, since the person going second will get to know what the other player did first, putting them in a better position c. It is possible, since going first allows a player to commit to their action...
11. Suppose two firms (1 and 2) sell differentiated products and compete by setting prices. The...
11. Suppose two firms (1 and 2) sell differentiated products and compete by setting prices. The demand functions are q1 = 7 − P1 + (P2/2) and q2 = 7 − P2 + (P1/2). Firms have a zero cost of production. (a) Find the Nash equilibrium in the simultaneous-move game. Also find the quantities sold by each firm. [5 marks] (b) Find the subgame-perfect equilibrium if 1 moves before 2. Also find the quantities sold by each firm. [5 marks]...
Consider a modified sequential version of Paper Scissors Rock where Player 1 goes first and chooses...
Consider a modified sequential version of Paper Scissors Rock where Player 1 goes first and chooses Paper, Scissors or Rock, and Player 2 goes second and chooses Paper, Scissors, or Rock. For each player, a win gets a payoff of 1, a loss gets a payoff of -1, and a tie get a payoff of 0. (a) (9 points) Write out the entire game tree for this sequential game. (b) (4 points) Find all the subgame perfect equilibria using backwards...
Consider the following game. Player 1’s payoffs are listed first, in bold:                        Player 2 X...
Consider the following game. Player 1’s payoffs are listed first, in bold:                        Player 2 X Y Player 1 U 100 , 6   800 , 4 M 0 , 0 200 , 1 D 10 , 20 20 , 20 Imagine that Player 1 makes a decision first and Player 2 makes a decision after observing Player 1’s choice. Write down every subgame-perfect Nash equilibrium of this game. Does the outcome above differ from the Nash equilibrium (if the game...
Consider the following 2 period sequential game. There are two players, Firm 1 and Firm 2....
Consider the following 2 period sequential game. There are two players, Firm 1 and Firm 2. They pro- duce identical goods and these goods are perfect substitutes. The inverse demand function in this market is given by P = 12 − (q1 + q2). Firm 1 moves first and choose its output q1. Firm 2 observes Firm 1’s decision of q1 and then chooses its output q2.\ Suppose that the cost function of both Firm 1 and 2 is given...
Consider a sequential game. Wally first chooses L or H. Having observed Wally’s choice, Elizabeth chooses...
Consider a sequential game. Wally first chooses L or H. Having observed Wally’s choice, Elizabeth chooses between A and F. The payoffs are as follows. If Wally chose L and Elizabeth chose A, the payoffs are 30 to Wally and 20 to Elizabeth. If Wally chose L and Elizabeth F, the payoffs are 40 to Wally and 10 and to Elizabeth. If Wally decides to opt for H and Elizabeth A, the payoffs are 10 and 2 to Wally and...
Assume a simple 2 player, sequential move game occurs as follows: Play rotates back and forth...
Assume a simple 2 player, sequential move game occurs as follows: Play rotates back and forth between players- player 1 moves first, then player 2, then player 1 again……and so on. Each time a player gets a chance to move, they choose a number 1 through 5 inclusive (so that 1,2,3,4, & 5 are the five choices they have). Every time a number gets selected, the number is added to a running tally of all numbers that have been selected....
Assume a simple 2 player, sequential move game occurs as follows: Play rotates back and forth...
Assume a simple 2 player, sequential move game occurs as follows: Play rotates back and forth between players- player 1 moves first, then player 2, then player 1 again……and so on. Each time a player gets a chance to move, they choose a number 1 through 5 inclusive (so that 1,2,3,4, & 5 are the five choices they have). Every time a number gets selected, the number is added to a running tally of all numbers that have been selected....