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

Bid rigging, A practice analogous to price fixing in which auction members ...

A practice analogous to price fixing in which auction members form a ring whose associates agree not to bid against each other, either by discarding the auction or by placing phony

Nash equilibrium, A Nash equilibrium, named when John Nash, may be a set of...

A 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. Players are in equi

Nash equilibrium, Assuming that there are only 2 airline companies in the w...

Assuming that there are only 2 airline companies in the world, Delta and US Airways, what is the ((Nash) Equilibrium) or price that each company in the following matrix will charge

Order condition for identification, This condition is based on a counting ...

This condition is based on a counting rule of the variables included and excluded from the particular equation. It is a necessary but no sufficient condition for the identi

All-pay auction, A type of auction in which the highest bidder is rewarded ...

A type of auction in which the highest bidder is rewarded the object, but all bidders pay the auctioneer their bids. This differs from traditional first price auctions in which onl

Ordinally symmetric game, Ordinally Symmetric Game Scenario Any game dur...

Ordinally Symmetric Game Scenario Any game during which the identity of the player doesn't amendment the relative order of the ensuing payoffs facing that player. In different w

Nash equilibrium - pay off, The following is a payoff matrix for a non-coop...

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 Nash Equilibri

Mba , in a rectangular game pay off matrix of player a is as follows B1 B2 ...

in a rectangular game pay off matrix of player a is as follows B1 B2 A1 5 7 A2 4 0 salve the game write down the pay off matrix of B and then solve the game.

Mixed strategy, A strategy consisting of potential moves and a chance distr...

A strategy consisting of potential moves and a chance distribution (collection of weights) that corresponds to how frequently every move is to be played. A player would solely use

Game playing in class-2 players take turns choosing a number, Problem:-Two ...

Problem:-Two players take turns choosing a number between 1 and 10 (inclusive), and a cumulative total of their choices is kept. The player to take the total exactly to 100 is the

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