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

Explain about the term game theory, Explain about the term Game Theory. ...

Explain about the term Game Theory. Game Theory: While the decisions of two or more firms considerably influence each others’ profits, in that case they are into a situation

Equilibrium, An equilibrium, (or Nash equilibrium, named when John Nash) ma...

An equilibrium, (or Nash equilibrium, named when John Nash) may be a set of methods, one for every player, such that no player has incentive to unilaterally amendment her action. P

Kakutani, Twentieth century mathematician who expanded on earlier fastened ...

Twentieth century mathematician who expanded on earlier fastened purpose theorems. a hard and fast purpose theorem defines the conditions on a perform, f(x), beneath that there exi

Sealed bid auction, An auction during which bidders simultaneously submit b...

An auction during which bidders simultaneously submit bids to the auctioneer while not information of the number bid by different participants. Usually, the very best bidder (or lo

Assurance game, Assurance game Scenario "Assurance game" may be a generi...

Assurance game Scenario "Assurance game" may be a generic name for the sport a lot of commonly called "Stag Hunt." The French thinker, Jean Jacques Rousseau, presented the subse

Personal theory of international trade, I have an assignment in which I hav...

I have an assignment in which I have to invent a new international trade theory. For me, the absolute advantage of Adam Smith is really good, and I want to find a solution if a cou

Application to strategic management, Game Theory has evolved since its orig...

Game Theory has evolved since its origins as an idea exercise for educational mathematicians. Taught in prime business faculties, economics departments, and even military academies

Variable add, In a Variable add game, the add of all player's payoffs diffe...

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

Dominant strategy equilibrium, The following is a payoff matrix for a non-c...

The following is a payoff matrix for a non-cooperative simultaneous move game between 2 players. The payoffs are in the order (Player 1; Player 2): What is the Dominant Strat

Rollback , Rollback (often referred to as backward induction) is an iterati...

Rollback (often referred to as backward induction) is an iterative method for solving finite in depth kind or sequential games. First, one determines the optimal strategy of the pl

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