Find the pure-strategy nash equilibrium, Game Theory

Assignment Help:

Find the pure-strategy Nash equilibrium

Alice is on vacation in Wonderland and considers trying a special mushroom sold by the caterpillar. She cannot tell upfront if the mushroom is good or bad; she only discovers it later if it gives her a stomach ache. For the caterpillar, it costs more to sell good quality mushroom. The payoffs of Alice and the caterpillar are given in the table below:

1253_Find the pure-strategy Nash equilibrium.png

(a) A pure strategy is a strategy that does not involve randomization. Find the pure-strategy Nash equilibrium/equilibria of this game.

(b) Alice likes Wonderland so she decides to stay there for 10 days: the above game is repeated 10 times. Can you find a trigger strategy that induces Buy/Good for all 10 periods? How about the first 9 days?

(c) Alice falls in love with Wonderland and decides to live there for the rest of her life. The above game is thus repeated infinitely. If the interest rate is zero, explain what trigger strategy will induce the cooperative Buy/Good equilibrium.

(d) Assume now that the interest rate is greater than zero, and the game is repeated infinitely. Find a range of r such that the cooperative equilibrium can be sustained.

(e) It is possible that Alice will have to leave Wonderland and return home eventually. More specifically, each period players think that there is a 30% chance that the game does not continue next period. Is the cooperative equilibrium still possible to maintain? If yes, for what values of the interest rate? If not, why not?

 


Related Discussions:- Find the pure-strategy nash equilibrium

Game of chicken, Scenario Two hooligans with one thing to prove drive at...

Scenario Two hooligans with one thing to prove drive at one another on a slender road. the primary to swerve loses faces among his peers. If neither swerves, however, a terminal

Animal puzzle, a) This you just have to list all the attributes for the pro...

a) This you just have to list all the attributes for the program. i.e. unique id's for puzzle pieces, attributes for the puzzle like a data field for the number of edges, methods t

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

Multiunit auction, An auction during which many (more than one) things are ...

An auction during which many (more than one) things are offered for sale. Mechanisms for allocating multiple units embody discriminatory and uniform worth auctions.

All pure nash equilibrium for strategic form game, write a program in c tha...

write a program in c that takes n number finite players using gambit format and output is to be all pure strategy nash equilibrium

Vickrey auction, A sealed-bid second worth auction during which participant...

A sealed-bid second worth auction during which participants every simultaneously submit bids. The auctioneer discloses the identity of the very best bidder who is said the winner.

Fictitious play , A method by that players assume that the methods of their...

A method by that players assume that the methods of their opponents are randomly chosen from some unknown stationary distribution. In every amount, a player selects her best respon

Determine the pure strategy nash equilibria, a) Define the term Nash equili...

a) Define the term Nash equilibrium b) You are given the following pay-off matrix:   Strategies for player 1   Strategies for player 2

Finding Equilibrium in Game Theory, This is Case of Competitive Games. ...

This is Case of Competitive Games. Player 2 L R Player 1 L (60,40) (70,30) R (65,35) (60,40) Are either have dominant st

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