4. Some types of resource conflicts can be modeled using the following game. Two players would each like to capture a valuable resource, worth R. Each player must choose a strategy from {Amicable, Belligerent}. If one player chooses Belligerent while the other chooses Amicable, the first will walk away with the resource, leaving nothing for the other player. If they both choose Amicable, the resource will be split equally between them. If they both choose Belligerent, the resource will also be split equally between them, but they will each suffer a cost C. P2 Amicable Belligerent P1 Amicable Belligerent R/2, R/2 R, O 0, R R/2-C, R/2-C 4.1. What NEs in pure strategies will the game have for the case where a) R/2 > C, b) R/2 < C and c) R/2 = C? 4.2. Find a Nash equilibrium (NE) in fully (strictly) mixed strategies for this game using the indifference property. Assume that R and C are configured so that a fully mixed NE exists.

4. Some types of resource conflicts can be modeled using the following game. Two players would each like to capture a valuable resource, worth R. Each player must choose a strategy from {Amicable, Belligerent}. If one player chooses Belligerent while the other chooses Amicable, the first will walk away with the resource, leaving nothing for the other player. If they both choose Amicable, the resource will be split equally between them. If they both choose Belligerent, the resource will also be split equally between them, but they will each suffer a cost C. P2 Amicable Belligerent P1 Amicable Belligerent R/2, R/2 R, O 0, R R/2-C, R/2-C 4.1. What NEs in pure strategies will the game have for the case where a) R/2 > C, b) R/2 < C and c) R/2 = C? 4.2. Find a Nash equilibrium (NE) in fully (strictly) mixed strategies for this game using the indifference property. Assume that R and C are configured so that a fully mixed NE exists.

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

Up ооооо Down Player 1 Up No EFFICIENT equilibrium exists Down Up Down Player 2 P1 gets $120 P2 gets $5 P1 gets $100 P2 gets $10 P1 gets $95 P2 gets $95 In the game above, what is/are the EFFICIENT sub-game perfect Nash equilibrium? (up,up) (up,down) (down, up) (down, down) P1 gets $15 P2 gets $25
Consider the following sequential move game of imperfect information. Consider the following sequential move game of imperfect information. In the event that Otis chooses Down, then they play the simultaneous move game shown in normal form (where Otis chooses between X and Y and Maeve simultaneously chooses between W and V). A (25,6) Maeve Up B (5,10) (12,5) Otis Middle Maeve Down w Otis (0, 0) (10, 10) Y (15, 15) (0, 0) Find all (pure strategy) subgame perfect Nash equilibria.
Question 1 Consider the following game. Player 1 has 3 actions (Top, middle,Bottom) and player 2 has three actions (Left, Middle, Right). Each player chooses their action simultaneously. The game is played only once. The first element of the payoff vector is player 1’s payoff. Note that one of the payoffs to player 2 has been omitted (denoted by x). A) Suppose that the value of x is such that player 2 has a strictly dominant strategy. Find the solution to the game. What solution concept did you use to solve the game? B) Suppose that the value of x is such the player 2 does NOT have a strictly dominant strategy. Find the solution to the game. What solution concept did you use to solve the game?
Two hunters are on a stag hunt. They split up in the forest and each have two strategies: hunt for a stag (S), or give up the stag hunt and instead hunt for rabbit (R). If they both hunt for a stag, they will succeed and each earn a payoff of 9. If one hunts for stag and the other gives up and hunts for rabbit, the stag hunter receives 0 and the rabbit hunter 8. If both hunt for rabbit then each receives 7. Compute all Nash equilibria for this game, called 'The Stag Hunt', depicted below. Which of these equilibria do you think is most likely to be played? Why? S R S 9,9 8,0 R 0,8 7,7
7. Solving for dominant strategies and the Nash equilibrium Suppose Andrew and Beth are playing a game in which both must simultaneously choose the action Left or Right. The payoff matrix that follows shows the payoff each person will earn as a function of both of their choices. For example, the lower-right cell shows that if Andrew chooses Right and Beth chooses Right, Andrew will receive a payoff of 6 and Beth will receive a payoff of 5. Andrew Left Right Left 8,4 5,4 Beth Right 4,5 6,5 The only dominant strategy in this game is for to choose The outcome reflecting the unique Nash equilibrium in this game is as follows: Andrew chooses and Beth chooses
2
When you are with a young child and want to show them something fun and new, there is the risk that, if they enjoy it, they'll ask for it over and over and over again, and if you ever say no they'll throw a fit, which you will then have to deal with. Consider the following game: First, you decide whether to show them an Old thing again, or a New thing. If you show them the Old thing, you get 2 points and the kid gets 2 points Then, If you showed them the New thing, the kid chooses whether to Ask for it to happen again, or Not Ask. If they choose Not Ask, you get 3 points and the kid gets 3 points If they choose to Ask, you can choose to say Yes, in which case you get 1 point and the kid gets 4 points, or No, in which case they throw a fit, and you get 0 points and the kid gets 2 points Draw the game tree for this game.
Two friends are deciding what activity to do on Saturday when they meet up. The following table shows the payoff matrix that represents the strategic interaction between them in a one-shot, simultaneous game. Select all the correct answers. Friend A Restaurant Cinema There is more than one Nash equilibrium Restaurant 10, 10 Friend B 4,7 Cinema 7,4 8,8
Susan and Thomas are playing a one-shot simultaneous move game an infinite time horizons. The payoffs matrix of the game played at each time period is Thomas R (3, 3) (13, 0) Susan (0, 13) (8,8) R. where the first number in each cell is the payoff to Susan and the second number is the payoff to Thomas. A trigger strategy of playing the Nash equilibrium forever if either agent deviates from the cooperative agreement will result in (R, R) being played at every time period so long as both agents' discount factors exceed: Check
7. Solving for dominant strategies and the Nash equilibrium Suppose Felix and Janet are playing a game in which both must simultaneously choose the action Left or Right. The payoff matrix that follows shows the payoff each person will earn as a function of both of their choices. For example, the lower-right cell shows that if Felix chooses Right and Janet chooses Right, Felix will receive a payoff of 7 and Janet will receive a payoff of 4. Felix Left Right Left 6,3 3,3 Janet Right 6,4 7,4 The only dominant strategy in this game is for to choose The outcome reflecting the unique Nash equilibrium in this game is as follows: Felix chooses and Janet chooses
8. Solving for dominant strategies and the Nash equilibrium Suppose Tim and Alyssa are playing a game in which both must simultaneously choose the action Left or Right. The payoff matrix that follows shows the payoff each person will earn as a function of both of their choices. For example, the lower-right cell shows that if Tim chooses Right and Alyssa chooses Right, Tim will receive a payoff of 3 and Alyssa will receive a payoff of 6. Tim Left Left 5, 6 Right 4, 2 Alyssa Right 5,5 3,6 The only dominant strategy in this game is for to choose The outcome reflecting the unique Nash equilibrium in this game is as follows: Tim chooses and Alyssa chooses
5. A game of Chicken is played by two lorry drivers who speed toward a narrow bridge. If one driver stops to let the other pass, they waste time, whereas the one who does not stop gets to their destination quicker. However, if both keep driving straight on then they crash. The game is played once, and drivers move simultaneously. Payoffs are given below (assume 0 < x < 10): Drive Stop Drive -10,-10 -x, 8 Stop 8,-1 0,0 (a) Find any pure strategy Nash equilibria of this game. (b) Find the mixed strategy Nash equilibrium of this game. (c) What happens to the column player's equilibrium mixed strategy as x increases? Explain why this happens. (d) Let x = 1. What are the rationalizable outcomes of this game? Do these offer a better prediction than the Nash equilibria?