Question: Please do 15.6 all sub parts and in a timely manner as this was not done last time. 15.5 Exercis 317 3,3.2)(0,0,0)(4,4,0 FIGURE 15.6 Selten's

Please do 15.6 all sub parts and in a timely manner as this was not done last time.  Please do 15.6 all sub parts and in a timely manner

15.5 Exercis 317 3,3.2)(0,0,0)(4,4,0 FIGURE 15.6 Selten's honse, exercise 15.6 Exiting costs nothing to the entrant. The entrant knows his type, but the incumbent knows only the prior distribution: Pr In response to any level of entry, the incumbent can modate (A) or fight (F). Accommodating an entrant imposes no costs. Inde- rendent of the entrant's type, accommodating small entry gives the incumbent 60% of the market and the entrant 40%, while accommodating big entry gives incumbent 40% of the market and the entrant 60%. Fighting a tough entrant the incumbent's market share by 20% (relative to accommodating) but imposes a cost of 4 on the incumbent. Fighting a weak entrant that chose s increases the market share of the incumbent to 10% hut m poses acost of 2 on the incumbent. Fighting a weak entrant that chose B increases the market share of the incumbent to 100% but imposes a cost of 8 on the incumbent. Draw this game in extensive form. Using a matrix representation, find all the pure-strategy Bayesian Nash equilibria for this game. Which one of the Bayesian Nash equilibria is preferred by the incum- bent? Can it be supported as a perfect Bayesian equilibrium? Find all the perfect Bayesian equilibria of this game. a. b. c. d. 56 Selten's Horse: Consider the three-person game described in Figure 15.6, known as Selten's horse (for the obvious reason). a. What are the pure-strategy Bayesian Nash equilibria of this game? b. Which of the Bayesian Nash equilibria that you found in (a) are perfect Which of the Bayesian Nash equilibria that you found in (a) are sequential equilibria? Bayesian equilibria? c

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!