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

Application to business strategy, Game Theory has evolved since its start a...

Game Theory has evolved since its start as a thought exercise for academic mathematicians. Taught in economics departments , top business schools, and the strategic analysis, even

Pure strategy, A pure strategy defines a selected move or action that a pla...

A pure strategy defines a selected move or action that a player can follow in each potential attainable state of affairs in a very game. Such moves might not be random, or drawn fr

Multiple item auction, Normal 0 false false false EN-US...

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

Yankee auction, Yankee auction typically implies a multiunit discriminatory...

Yankee auction typically implies a multiunit discriminatory English auction. not like a Vickrey auction where every winning bidder pays identical worth for every unit, in a very ya

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

Game assignment, About assignment The goal of this assignment is for th...

About assignment The goal of this assignment is for the student to propose a new game of your own and to be able to present their ideas in clear and convincing manner. This pro

Extensive kind, The in depth kind (also referred to as a game tree) may be ...

The in depth kind (also referred to as a game tree) may be a graphical illustration of a sequential game. It provides data concerning the players, payoffs, strategies, and also the

Game theory equilibrium exercise, Exercise 1 a) Pure strategy nash equi...

Exercise 1 a) Pure strategy nash equilibrium in this case is Not Buy, bad ( 0,0) as no one wants to deviate from this strategy. b) The player chooses buy in the first perio

Payoff matrix, 1. The publishing industry in the country of Font, where the...

1. The publishing industry in the country of Font, where the local currency is the stet, is dominated by two companies, the Arial Book Co. and Verdana Works Ltd.. Currently, both o

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