Identify the pure strategy equilibria, Game Theory

Assignment Help:

Consider the following three games (Chicken, Matching Pennies, Stag Hunt):

Chicken Player 2

Player 1

D V

D -100;-100 10;-10

V -10; 10 -1;-1

Matching Pennies Player 2

Player 1

H T

H 1;-1 -1; 1

T -1; 1 1;-1

Stag Hunt Player 2

Player 1

S R

S 5; 5 0; 1

R 1; 0 1; 1

(a) In each of the above games, identify the pure strategy Nash Equilibria when both players move simultaneously

(b) Now imagine that player 1 chooses her action .rst, and player 2 observes player 1.s choice before choosing her action. What will be subgame perfect Nash Equilibrium outcome of each game? (you do not need to be very formal in this question. An explanation based on your answer to a. will be enough).

(c) In which game(s) is there a .rst mover advantage? In which game(s) is there a second mover advantage? Does making the game sequential ever bene.t both players?


Related Discussions:- Identify the pure strategy equilibria

Bayes, Eighteenth century British mathematician who recognized a method for...

Eighteenth century British mathematician who recognized a method for probabilistic mathematical inference. His Bayes Theorem, published posthumously, treats probability as a logic.

Dominated strategy , A strategy is dominated if, no matter what the other p...

A strategy is dominated if, no matter what the other players do, the strategy earns a player a smaller payoff than another strategy. Hence, a method is dominated if it's invariably

Game playing in class:adding numbers—win at 100, GAME PLAYING IN CLASS GAME...

GAME PLAYING IN CLASS GAME 1 Adding Numbers—Win at 100 This game is described in Exercise 3.7a. In this version, two players take turns choosing a number between 1 and 10 (inclus

Positive add, In a positive add game, the combined payoffs of all players a...

In a positive add game, the combined payoffs of all players aren't identical in each outcome of the sport. This differs from constant add (or zero add) games during which all outco

Multiple nash equilibria, The following is a payoff matrix for a non-cooper...

The following is a payoff matrix for a non-cooperative simultaneous move game between 2 players. The payoffs are in the order (Player 1; Player 2): What is/are the Nash Equil

Computer game zenda, Computer Game Zenda This game was invented by Jame...

Computer Game Zenda This game was invented by James Andreoni and Hal Varian; see their article, "Pre-Play Contracting in the Prisoners 'Dilemma".The paper also contains some co

Bayesian Cournot, Consider the Cournot duopoly model in which two firms, 1 ...

Consider the Cournot duopoly model in which two firms, 1 and 2, simultaneously choose the quantities they will sell in the market, q1 and q2. The price each receives for each unity

Bidder''s choice, A multiunit auction mechanism for assigning heterogeneous...

A multiunit auction mechanism for assigning heterogeneous (different) objects. The highest bidder in the first round selects one item among those offered for sale. Then, a second r

Game playing in class-equilibrium payoffs example, (a) Equilibrium payoffs ...

(a) Equilibrium payoffs are (1, 0). Player A’s equilibrium strategy is S; B’s equilibrium strategy is “t if N.”   For (a): Player A has two strategies: (1) N or (2) S. P

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd