Perfect nash equilibrium, Game Theory

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.

Posted Date: 2/15/2013 6:53:22 AM | Location : United States







Related Discussions:- Perfect nash equilibrium, Assignment Help, Ask Question on Perfect nash equilibrium, Get Answer, Expert's Help, Perfect nash equilibrium Discussions

Write discussion on Perfect nash equilibrium
Your posts are moderated
Related Questions
In a Variable add game, the add of all player's payoffs differs counting on the methods they utilize. this can be the other of a continuing add game during which all outcomes invol

Normal 0 false false false EN-US X-NONE X-NONE


Ordinal payoffs are numbers representing the outcomes of a game where the worth of the numbers isn't vital, however solely the ordering of numbers. for instance, when solving for a

When players interact by enjoying an identical stage game (such because the prisoner's dilemma) varied times, the sport is termed a repeated game. not like a game played once, a re

Normal 0 false false false EN-US X-NONE X-NONE

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

James and Dean are playing the Chicken game. They have noticed that their payout for being perceived as "tough" depends on the size of the crowd. The larger the crowd, the "cooler"


A reserve worth is that the minimum acceptable bid in an auction. If no bidder submits a bid higher than the reserve worth, the auctioneer keeps the item offered for sale. Alternat