Perfect nash equilibrium, Game Theory

Assignment Help:

Perfect Nash equilibrium

Two students prepare their homework assignment together for a course. They both enjoy getting high grade for their assignment, but they dislike working on the assignment. They can both choose to supply Low, Medium or High level of effort. Their payoff is given in the table below:

 

2411_perfect Nash equilibrium.png

(a) Find all pure-strategy Nash equilibria of this game. Can the efficient outcome be achieved in equilibrium in a one-shot game?

(b) In this course students have to hand in two assignments. Thus, the above game is played twice. Start by assuming that students are very patient (no discounting between the periods). Is there a sub-game perfect Nash equilibrium that can achieve the outcome M-M in the first stage? If yes, describe this equilibrium, otherwise explain why it is not possible. Hint: discuss whether we have a problem with credible threats here.

(c) How does your answer in part (b) change if we now assume very impatient students with δ= 0:3? Provide both calculations and intuition.


Related Discussions:- Perfect nash equilibrium

Find the quantities that firm is selling – equilibrium price, 1. Two firms,...

1. Two firms, producing an identical good, engage in price competition. The cost functions are c 1 (y 1 ) = 1:17y 1 and c 2 (y 2 ) = 1:19y 2 , correspondingly. The demand functi

Game playing in class-equilibrium payoffs are (2, Equilibrium payoffs are ...

Equilibrium payoffs are (2, 3, 2). Player A’s equilib- rium strategy is “N and then N if b follows N or N if d follows N” or “Always N.” Player B’s equilibrium strategy is “b if N

Simultaneous game, A simultaneous game is one during which all players buil...

A simultaneous game is one during which all players build choices (or choose a strategy) while not information of the methods that are being chosen by different players. Although t

English auction, A type of sequential second worth auction during which an ...

A type of sequential second worth auction during which an auctioneer directs participants to beat the present, standing bid. New bids should increase the present bid by a predefine

Backward induction, Backward induction is an iterative procedure for resolv...

Backward induction is an iterative procedure for resolving finite general form or sequential games. First, one decides the finest policy of the player who makes the last move of th

Find pure nash equilibria, Find Pure Nash Equilibria 1. Consider a two-...

Find Pure Nash Equilibria 1. Consider a two-player game in which player 1 chooses the strategy x 1 from the closed interval [-1, 1] while player 2 chooses the strategy x 2 fr

Formulate the situation as strategic game - nash equilibrium, Two individua...

Two individuals use a common resource (a river or a forest, for example) to produce output. The more the resource is used, the less output any given individual can produce. Denote

Find the nash equilibria of game - bimatrix of strategies, Players 1 and 2 ...

Players 1 and 2 are bargaining over how to split one dollar. Both players simultaneously name shares they would like to keep s 1 and s 2 . Furthermore, players' choices have to be

Draw a table representing the prisoner?s dilemma game, (a) Draw a table rep...

(a) Draw a table representing the Prisoner?s Dilemma game. (b) Give a story inspired by real life for the prisoner?s dilemma game that is di¤erent from the story about the two crim

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