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

Game 4 auctioning a penny jar (winner’s curse), GAME 4 Auctioning a Penny J...

GAME 4 Auctioning a Penny Jar (Winner’s Curse) Show a jar of pennies; pass it around so each student can have a closer look and form an estimate of the contents. Show the stud

Player , Any participant in a very game who (i)  contains a nontrivial s...

Any participant in a very game who (i)  contains a nontrivial set of methods (more than one) and (ii) Selects among the methods primarily based on payoffs. If a player is non

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.

Fighting for survival, Two animals are fighting over a prey. The prey is wo...

Two animals are fighting over a prey. The prey is worth v to each animal. The cost of fighting is c1 for the first animal (player 1) and c2 for the second animal (player 2). If the

Totally mixed strategy, A mixed strategy during which the player assigns st...

A mixed strategy during which the player assigns strictly positive chance to each pure strategy.Morgenstern, Oskar,Coauthor of Theory of Games and Economic Behavior with John von N

Find a bayesian nash equilibrium, In Bontemps, Louisiana there are only two...

In Bontemps, Louisiana there are only two places to spend time: Merlotte's bar and Fangtasia. Sookie and Eric have made plans to spend Friday night together, but they never decided

Difference monopolistic competition and perfect competition, What is the di...

What is the different monopolistic competition and perfect competition? Monopolistic Competition versus Perfect Competition Into the long-run equilibrium of a monopolistical

Coalitional game and matching markets, 1. This question and the next is bas...

1. This question and the next is based on the following description. Consider the coalitional game (referred to as Game 1) given by: N = {1,2,3,4}; v(N) = 3, v{i} = 0, i = 1,...,4,

Payoff, In any game, payoffs are numbers that represent the motivations of ...

In any game, payoffs are numbers that represent the motivations of players. Payoffs might represent profit, quantity, "utility," or different continuous measures (cardinal payoffs)

Paired prisoners'' dilemma, Paired Prisoners' Dilemma Students can be p...

Paired Prisoners' Dilemma Students can be paired off and instructed to play several ver-sions of a particular game with a prisoners' dilemma structure.Provide each pair with a

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