(DSR, Chp 6, U7) The members of a hierarchical group of three hungry lions face a piece of prey. If lion 1 does not eat the prey, the game ends. If it eats the prey, it becomes fat and slow, and lion 2 can eat it. If lion 2 does not eat lion 1, the game ends; if it eats lion 1 then it may be eaten by lion 3. Each lion prefers to eat and stay alive (payoff=4) than to stay alive but go hungry (payoff =3), but prefers to be hungry than to be eaten (payoff=2). (a) Draw the game tree, with payoffs, for this hungry lion game, and find the subgame perfect equilibrium. (b) Write out this game in normal form. Make lion 1 the row player, lion 2 the column player, and lion 3 the page/table player. (c) Find all of the Nash equilibria for the game. (d) You should have found Nash equilibria that are not subgame-perfect. For each of those equilibria, which lion is making a noncredible treat? Explain.

(DSR, Chp 6, U7) The members of a hierarchical group of three hungry lions face a piece of prey. If lion 1 does not eat the prey, the game ends. If it eats the prey, it becomes fat and slow, and lion 2 can eat it. If lion 2 does not eat lion 1, the game ends; if it eats lion 1 then it may be eaten by lion 3. Each lion prefers to eat and stay alive (payoff=4) than to stay alive but go hungry (payoff =3), but prefers to be hungry than to be eaten (payoff=2). (a) Draw the game tree, with payoffs, for this hungry lion game, and find the subgame perfect equilibrium. (b) Write out this game in normal form. Make lion 1 the row player, lion 2 the column player, and lion 3 the page/table player. (c) Find all of the Nash equilibria for the game. (d) You should have found Nash equilibria that are not subgame-perfect. For each of those equilibria, which lion is making a noncredible treat? Explain.

ENGR.ECONOMIC ANALYSIS

14th Edition

ISBN:9780190931919

Author:NEWNAN

Publisher:NEWNAN

Chapter1: Making Economics Decisions

Section: Chapter Questions

Problem 1QTC

See similar textbooks

Similar questions

Boris and Angela are negotiating a new trade deal, which resembles a modified centipede game. When it is their turn, each of them decides whether to cooperate (C) or to decline (D). Unfortunately, Angela is not sure how much time Boris has for the negotiations before he needs to leave to talk to Emmanuel. With probability p = 4/5, Boris will stay and insist on making the final proposal (long game, L). With probability 1 − p = 1/5, Boris will have to rush off, so that the game ends after Angela’s move (short game, S). Boris has perfect knowledge of his schedule. The structure and payoffs are represented in the game tree below (Attached picture). (a) Specify the set of possible histories H of the game. Underline terminal histories.(b) Specify the set of possible strategies for Boris and Angela.(c) How many subgames does this game have? Indicate all subgames in this game
Two construction companies are lobbying to obtain a share of work on repaving city streets. The share of the project going to each firm depends on money contributions to the mayor’s reelection fund. The project has value V in total. The mayor is somewhat biased in favor of firm 1, which is run by his niece. If firm 1 contributes x1 and firm 2 contributes x2, with at least one contribution strictly larger than zero, then the shares of the project going to firms 1 and 2 are s1 and s2, respectively, where (see picture)
Here is a Bayesian BOS game. Man has a special preference t1 on boxing while woman has a special preference t2 on opera. Both are in [0,2]. The preference information is private. i.e. Each knows his (her) own preference but does not know the other's preference. The below is the payoff. M/W Boxing Opera Воxing 3+t1,1 0,0 Opera 0,0 1,3+t2 We are checking whether the below strategy profile is a Bayesian Nash Equilibrium. "Man chooses boxing if t1>p while woman chooses opera if t2>g." 1) Given t1, man will choose boxing if t1> /g- 2) Given t2, woman will choose opera if t2> /p- 4) By shoving the simultaneous equations, we get p=q=sqrt(6)-
P1| P2 Left Middle Right Left 4,2 3,3 1,2 Middle 3,3 5,5 2,6 Right 2,1 6,2 3,3 Consider the simultaneous move game represented by this payoff matrix. Suppose that the game is repeated for two periods and the players know that the game will end at the end of two periods. They observe the first period outcome before they move to the second period. Assume that there is no discounting, i.e. 2nd period payoffs are not discounted, or the discount factor is equal to 1. Which of the following outcomes could occur in some subgame perfect equilibrium (SPE) of this repeated game? Choose True if you think the outcome can be a SPE, otherwise choose False. a) (Left, Left) is played in both periods. b) (Right, Right) is played in both periods. c) (Middle, Middle) is played in both periods. d) (Middle, Middle) is played in the first period, followed by (Left, Left). e) (Middle, Middle) is played in the first period, followed by (Right, Right).
3. Two individuals are involved in a synergistic relationship. If both individuals devote more effort to the relationship, they are both better off. Specifically, an effort level is a nonnegative number, and player 1's payoff function is e₁(1+€₂-e₁), where ei is player i's effort level. For player 2 the cost of effort is either the same as that of player 1, and hence her payoff function is given by e2(1+e₁ - e₂), or effort is very costly for her in which case her payoff function is given by e₂(1 + e₁ — 2e2). 1 Player 2 knows player 1's payoff function and whether the cost of effort is high for herself or not. Player 1, however, is uncertain about player 2's cost of effort. He believes that the cost of effort is low with probability p, and high with probability 1 - p, where 0 < p < 1. Find the Bayesian Nash equilibrium of this game as a function of p.
The police want to discourage drunk driving. You can drink wine or cola at your friend’s party. But since you are driving home you may get stopped by the police as they might conduct RIDE this evening (RIDE is a sobriety testing program used by police in Ontario). If you drink wine, you will drink four glasses, and if RIDE is active you will be charged with drunk driving and go to jail. Solve the game. Police You Wine RIDE (-2,-1) (0,-1) No RIDE (1,-2) (0,0) Cola
The Government of Malaca has decided to sell pollution permits that will allow people to discharge pollutants into its largest freshwater lake. Each permit represents the right to discharge one tonne of pollutants. Malaca has determined that the lake will tolerate a maximum of 10 tonnes of pollutants per year and has decided to sell the permits using a Dutch auction. This means that the auction starts at a very high price, which is reduced in steps until the price reaches a level that will result in all 10 tonnes of pollution permits being sold at the same price. The results of the bidding are shown in table below. Price per Pollution Bidder Bidder Bidder Bidder Bidder Permit A. B D $5, 500 1 5,000 4,500 4,000 1. 1. 1 2 2. 3 2 1 2 3,500 3,000 2,500 2,000 4 3 2 4 4 4 3 4 4 1,500 7 a. What will be the price of pollution permits as a result of this auction? Price: $ b. Suppose that Bidder E happened to be an environmental protection group. If this group had not participated in the…
Solve both questions for postive rating
In this game, (80, 50) 52% a) (R, N) b) (R, R) c) (S, N) d) (R, P) S is a Nash equilibrium First Player (20,68) 12% R P Second Player N (90,70) 36%
There are three bidders participating in a first-price auction for a painting. Each bidder has a private, independent value vi for such a painting that is drawn uniformly from [0,1] Assume that each bidder i has a linear bidding function bi=avi, where a>0. What is the bidding strategy of bidder i , namely bi in the Bayesian equilibrium?
The ultimatum game is a game in economic experiments. The first player (the proposer) receives a sum of money and proposes a fair proposal (F - 5;5) or unfair proposal (U - 8;2). The second player (the responder) chooses to either accept (A) or reject (R) this proposal. If the second player accepts, the money is split according to the proposal. If the second player rejects, neither player receives any money. 1 A 5:5 2 F R 0:0 U A 8:2 2 1. Find the subgame perfect Nash Equilibrium using backward induction. R 0;0
During a grand prix car race with 20 competitors, Driver 1 and Driver 2 are currently in 1st and 2nd place, respectively, Driver 2 is catching up to Driver 1, and is thinking about overtaking Driver 1 on the next corner. Driver 1 has two strategies: Driver 1 can either "BLOCK" Driver 2 from overtaking, or "ALLOW" Driver 2 to overtake. Driver 2 (currently in second place) also has two possible strategies: Driver 2 can either try to "OVERTAKE" Driver 1, or "STAY" in 2nd place. Both drivers desperately want to win, but unsuccessful overtaking wastes fuel and increases the risk of falling behind other drivers in the race. Blocking manoeuvres can increase a driver's lead if the other driver decides to stay back, but these manoeuvres can also damage the car if another driver is trying to overtake. The only situation under which Driver 1 will be overtaken by Driver 2 is if Driver 2 attempts to overtake and Driver 1 allows it. The resulting payoff matrix for these various strategies is shown…