Alex and Bob are co-workers, and they must complete a project together. Each of them independently and simultaneously must decide whether to make a low effort (L), medium effort (M), or high effort (H) to complete this project. The normal form representation of the game via a payoff matrix is given below. Alex L M H L 1,2 3,1 6,3 Bob M 2,3 5,3 4,2 H 4,4 3,2 3,1

Alex and Bob are co-workers, and they must complete a project together. Each of them independently and simultaneously must decide whether to make a low effort (L), medium effort (M), or high effort (H) to complete this project. The normal form representation of the game via a payoff matrix is given below. Alex L M H L 1,2 3,1 6,3 Bob M 2,3 5,3 4,2 H 4,4 3,2 3,1

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter15: Imperfect Competition

Section: Chapter Questions

Problem 15.7P

See similar textbooks

Similar questions

if Y = 4 (a) If ⟨a,d⟩ is played in the first period and ⟨b,e⟩ is played in the second period, what is the resulting (repeated game) payoff for the row player? (b) What is the highest payoff any player can receive in any subgame perfect Nash equilibrium of the repeated game?
Supersubs and Hotwich are the only two sandwich shops in town. They have differentiated their products so that Supersubs sells cold sub sandwiches and Hotwich sells hot sandwiches. At any given time, however, Supersubs could expand its selection by purchasing a toaster and Hotwich could also easily start offering cold sandwiches. Refer to the game for the expected payoffs of their possible choices. Supersubs Sell cold only Expand selection Hotwich Sell hot only A $12$12 $10$10 B $18$18 $2$2 Expand selection C $2$2 $19$19 D $5$5 $6$6 What is the unique equilibrium outcome for a one-time game?
Two players play the following game for infinite times. For the player to continue to cooperate what would be the ranges of their discount factor, δ_1 and δ_2, respectively? cooperate betray cooperate (10,20) (-25,30) betray (15, -22) (-12, -18)
Consider the following strategic game with 2 players: P1 AND P2 E F G H A 10,30 0,50 5,5 40,20 B 40,10 10,10 8,20 30,5 C 15,5 10,30 5,20 25,20 D 20,3 20,8 6,6 20,0 (a) Specify the strategies for P1 and P2, respectively. Eliminate all strictlydominated strategies, and FIND the reduced game until you can reduce the game nofurther.(b) Find all the Nash equilibria for the reduced game, including the mixed-strategy ones
Normal-Form GameFind all Nash equilibria of the following two-player game. Provide necessary computation.
Suppose that 5 risk neutral competitors participate in a rent seeking game with a fixed prize of $100. Each player may invest as much as he wishes in the political contest, although those investments have an opportunity cost equal 1. The probability of winning is directly proportional to the candidate’s share of the total rent-seeking investment. What is the profit-maximizing investment by player 1 as a function of the investment by all the others? What is a Nash equilibrium investment by each player in a symmetric game?
Consider a game with two players (Alice and Bob) and payoffffs Bob Bob s1 s2 Alice, s1 3, 3 0, 0 Alice, s2 0, 0 2, 2 In the equilibrium in the above game, Alice should (A) always choose the fifirst strategy s1; (B) choose the fifirst strategy s1 with probability 40% ; (C) choose the fifirst strategy s1 with probability 50% ; (D) choose the fifirst strategy s1 with probability 60% .
There are three players who must each choose an “effort” level from 1 to 7, that is, Si = {1, 2, 3, ..., 7}. The payoff for each player i is ui(si, s−i) = 10 max{s1, s2, s3} − si. How many pure- strategy Nash equilibria are there? Select one: a.2 b.4 c.none of the other answers d.3 e.1
Consider the following representation of a Normal form game. actions w a (45,22) (10,38) (42,13) (10,7) (p,28) (15,40) (q,10) (44,10) (20,22) (14,31) (27,13) (12,8) d. (20,41) (9,48) (28,24) (18,32) Here each cell in the table represents an ordered pair. First element is payoff of the first player and second element is payoff of the second player. The letters a, b, c, d, x, y, z, w represent the actions. Write down the table in your answer script too. Now answer the following questions: 1. What is the distinction between strictly dominant strategy and weakly dominant strategy? Is it reasonable for a player to play a strictly dominated strategy? Explain why. 2. What are the minimum values for p and q that will make ba strategy that strictly dominates all other strategies for player 1, assuming both p and q are natural numbers? 3. Does player 2 have any strictly dominated pure strategy? If yes, which pure strategy dominates that strategy? If the submit button is off it is beacuse the due…
on 8.1 Consider the following game: Player 1 A C D 7,6 5,8 0,0 Player 2 E 5,8 7,6 1, 1 F 0,0 1,1 4,4 a. Find the pure-strategy Nash equilibria (if any). b. Find the mixed-strategy Nash equilibrium in which each player randomizes over just the first two actions. c. Compute players' expected payoffs in the equilibria found in parts (a) and (b). d. Draw the extensive form for this game.
1. What are the advantages and disadvantages of collusion? Define Collusion 2. In a Stackelberg game, what is the best response that follower firm 2 can make to the choice y1 already made by the leader, firm 1? Defining the game and provide an example of the best response.
Consider the “trust game” discussed in class. The first player starts with a $100 endowment and chooses how much to give to the second player. The gift triples in value (i.e. if $20 is given, the second player receives $60). The second player then chooses how much to give back. The first player receives exactly how much is returned (i.e. if $40 is returned, the first player receives $40). The Nash equilibrium of the game is: Group of answer choices: -First player gives $100, second player returns nothing. -First player gives $50, second player returns $50. -First player gives $100, second player returns $300. -There is no Nash equilibrium of this game. -First player gives nothing, second player returns nothing.