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

Deadlock , Description The simplest of William Poundstone's social dilem...

Description The simplest of William Poundstone's social dilemmas during which the every player contains a dominant strategy and also the equilibrium is Pareto optimal. the sole

Mixed strategy, A strategy consisting of potential moves and a chance distr...

A strategy consisting of potential moves and a chance distribution (collection of weights) that corresponds to how frequently every move is to be played. A player would solely use

Blind auction, Another term for a preserved bid auction in which bidders si...

Another term for a preserved bid auction in which bidders simultaneously submit bids to the auctioneer with no knowledge of the amount bid by other member. Usually, the uppermost b

Design mousetrap game board, Three flowcharts and the game board for your m...

Three flowcharts and the game board for your mousetrap game should be submitted. You can use board_design.pdf to help you lay out your board. Basically, you can use any shapes you

Zero restriction, A priori knowledge usually enables us to decide that some...

A priori knowledge usually enables us to decide that some coefficients must be zero in the particular equation, while they assume non-zero values in other equations of the system.

Weakly dominant strategy , A strategy is weakly dominant if, no matter what...

A strategy is weakly dominant if, no matter what the other players do, the strategy earns a player a payoff a minimum of as high as the other strategy, and, the strategy earns a st

Rollback , Rollback (often referred to as backward induction) is an iterati...

Rollback (often referred to as backward induction) is an iterative method for solving finite in depth kind or sequential games. First, one determines the optimal strategy of the pl

Combining simultaneous and sequential moves, Combining Simultaneous and...

Combining Simultaneous and  Sequential Moves The material in this chapter covers a variety of issues that require some knowledge of the analysis of both sequential- move

Button auction, A form of a Japanese auction (which is a form of an English...

A form of a Japanese auction (which is a form of an English auction) in which bidders hold down a button as the auctioneer frequently increases the current price. Bidders irrevocab

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