Question

Consider a game being played between player 1 and player 2. Player 1 can choose T or B. Player 2 can take actions Lor R. Thes

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Option (4).

Payoff matrix as follows.

Player 2
L R
Player 1 T (0,    0) (6,    2)
B (5,    7) (0,    0)

When Player 1 chooses T, Player 2's best strategy is R since payoff is higher (2 > 0).

When Player 1 chooses B, Player 2's best strategy is L since payoff is higher (7 > 0).

When Player 2 chooses L, Player 1's best strategy is B since payoff is higher (5 > 0).

When Player 2 chooses R, Player 1's best strategy is T since payoff is higher (6 > 0).

So, Nash equilibria are: (B, L) and (T, R) [see below]

Player 2 R (0, 0) (6 2) т Player 1 (5,1 7(0, 0) В

Add a comment
Know the answer?
Add Answer to:
Consider a game being played between player 1 and player 2. Player 1 can choose T...
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. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Consider a game being played between player 1 and player 2. Player 1 can choose T...

    Consider a game being played between player 1 and player 2. Player 1 can choose T or B. Player 2 can take actions Lor R. These choices are made simultaneously. The payoffs are as follows. If 1 plays T and 2 plays L, the payoffs are (0,0) for Player 1 and 2, respectively. If 1 opts of B and 2 L, the payoffs are (5,7). If 1 plays T and 2 R, the payoffs are (6,2). Finally, both players get...

  • 2. Consider the following sequential game. Player A can choose between two tasks, Tl and T2....

    2. Consider the following sequential game. Player A can choose between two tasks, Tl and T2. After having observed the choice of A, Player B chooses between two projects Pl or P2. The payoffs are as follows: If A chooses TI and B chooses P1 the payoffs are (12, 8), where the first payoff is for A and the second for B; if A chooses T1 and B opts for P2 the payoffs are (20, 7); if A chooses T2...

  • 2. Consider the following sequential game. Player A can choose between two tasks, TI and T2....

    2. Consider the following sequential game. Player A can choose between two tasks, TI and T2. After having observed the choice of A, Player B chooses between two projects P1 or P2. The payoffs are as follows: If A chooses TI and B chooses Pl the payoffs are (12.8), where the first payoff is for A and the second for B; if A chooses TI and B opts for P2 the payoffs are (20,7); if A chooses T2 and B...

  • GAME MATRIX Consider two players (Rose as player 1 and Kalum as player 2) in which each player has 2 possible actions (...

    GAME MATRIX Consider two players (Rose as player 1 and Kalum as player 2) in which each player has 2 possible actions (Up or Down for Rose; Left or Right for Kalum. This can be represented by a 2x2 game with 8 different numbers (the payoffs). Write out three different games such that: (a) There are zero pure-strategy Nash equilibria. (b) There is exactly one pure-strategy equilibrium. (c) There are two pure-strategy Nash equilibria. Consider two players (Rose as player...

  • 4. Consider the following game that is played T times. First, players move simultaneously and independently....

    4. Consider the following game that is played T times. First, players move simultaneously and independently. Then each player is informed about the actions taken by the other player in the first play and, given this, they play it again, and so on. The payoff for the whole game is the sum of the payoffs a player obtains in the T plays of the game A 3,1 4,0 0,1 В 1,5 2,2 0,1 C 1,1 0,2 1,2 (a) (10%) Suppose...

  • 1. Consider the following normal form game: 112 L CR T 10 102 12 0 13...

    1. Consider the following normal form game: 112 L CR T 10 102 12 0 13 M 12 25 5 0 0 B|13 010 011 a) (Level A) First suppose this game is played only once. What are the pure strategy Nash equilibria? (b) (Level B) Now suppose this game is played twice. Players observe the actions chosen in the first period prior to the second period. Each player's total payoff is the sum of his/her payoff in the two...

  • 1. Consider the following normal form game 112 L CR T|10 1012 1210 13 M 12...

    1. Consider the following normal form game 112 L CR T|10 1012 1210 13 M 12 25 5 0 (0 B113 0100 (a) (Level A) First suppose this game is played only once. What are the pure strategy Nash equilibria? (b) (Level B) Now suppose this game is played twice. Players observe the actions chosen in the first period prior to the second period. Each player's total payoff is the sum of his/her payoff in the two periods. Consider the...

  • 1. Consider the following normal form game: 112 LC R T10 102 12 0 13 M...

    1. Consider the following normal form game: 112 LC R T10 102 12 0 13 M 12 25 5 0 0 В|13 010 0111 (a) (Level A) First suppose this game is played only once. What are the pure strategy Nash equilibria? b) (Level B) Now suppose this game is played twice. Players observe the actions chosen in the first period prior to the second period. Each player's total payoff is the sum of his/her payoff in the two periods....

  • In the extensive form representation of the game between Player 1 and Player 2, Player 1...

    In the extensive form representation of the game between Player 1 and Player 2, Player 1 moves first and chooses L or R. If Player 1 chooses R the game ends, if Player 1 chooses L then Player 1 and 2 play a simultaneous move game. The game has______________ pure strategy Nash equilibria and__________ pure strategy Subgame Perfect Nash Equilibria (SPNE). The maximum payoff Player 2 gets in a SPNE is___________ . (Please, enter only numerical answers like: 1, 2,...

  • Technology Adoption: During the adoption of a new technology a CEO (player 1) can design a...

    Technology Adoption: During the adoption of a new technology a CEO (player 1) can design a new task for a division manager. The new task can be either high level (H) or low level (L). The manager simultaneously chooses to invest in good training (G) or bad training (B). The payoffs from this interaction are given by the following matrix: Player 2 GB 5,4 -5,2 H Player 1 L 2, -2 0,0 a. Present the game in extensive form (a...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT