[39] Consider the following dynamic game: Player 1 moves first, choosing between strategies A and B. If 1 chooses A, then player 2 moves, choosing between strategies C and D. If 1 chooses B, then 2 chooses between E and F. If 2 chooses E, the game ends. If 2 chooses F, the game continues, with 1 choosing between G and H. The payoffs are indicated in parentheses at the bottom of the game tree, with 1's payoffs 1st and 2's payoffs 2nd.

[39] Consider the following dynamic game: Player 1 moves first, choosing between strategies A and B. If 1 chooses A, then player 2 moves, choosing between strategies C and D. If 1 chooses B, then 2 chooses between E and F. If 2 chooses E, the game ends. If 2 chooses F, the game continues, with 1 choosing between G and H. The payoffs are indicated in parentheses at the bottom of the game tree, with 1's payoffs 1st and 2's payoffs 2nd.

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

Problem 3. Val and Earl are at work on a very hot afternoon. There is a job waiting for them. It takes only one person to do the job. The one who does it must crawl through a mucky culvert to connect a pipe. Once the pipe is connected, they can both go to a comfortable tavern for a beer. The game tree is shown below, where at the terminal nodes, the top number is Val's payoff and the bottom number is Earl's payoff. Val Do it Stall V 5 E 10 Earl Do it Stall 9 Val 4 Do it Stall 38 Earl Do it Stall 7 Val Do it Stall Earl 110 Do it Leave it 5 0 X X At the beginning of play, Earl is working on another job, but Val could do the job and if he does it right away, they can both go out for beer. Val could choose to stall, waiting for Earl to come back. If Val decides to stall, then when Earl gets back, he could do the job, or he could stall. If Earl chooses to stall, Val could either do the job, or stall again, and so on... If Val and Earl both stall until Earl's final decision node at the end…
Please find herewith a payoff matrix. In each cell you find the payoffs of the players associated with a particular strategy combination: The first entry is the payoff of player 1, the second entry is the payoff of player2. Player 2 t1 t2 t3 Player 1 S1 3, 4 1, 0 5, 3 S2 0, 12 8, 12 4, 20 S3 2, 0 2, 11 1, 0 Suppose both players select their strategies (S1, S2 or S3 for player 1 and t1, t2 or t3 for player 2) simultaneously and that the game is played once. In your explanation to the questions below, please do refer to the figures in the matrix. Suppose player 2 could move before player 1 (i.e. has a first mover advantage). In your explanation to the questions below, please do refer to the figures in the matrix. What strategy would (s)he select? Is it really an ‘advantage’ for player 2 to move first? Or does player 2 benefit from being the second mover (and hence player 1 moving first)? I.e. for this question, do not make a comparison to the outcome of the…
Cameron and Luke are playing a game called ”Race to 10”. Cameron goes first, and the players take turns choosing either 1 or 2. In each turn, they add the new number to a running total. The player who brings the total to exactly 10 wins the game. a) If both Cameron and Luke play optimally, who will win the game? Does the game have a first-mover advantage or a second-mover advantage? b) Suppose the game is modified to ”Race to 11” (i.e, the player who reaches 11 first wins). Who will win the game if both players play their optimal strategies? What if the game is ”Race to 12”? Does the result change? c) Consider the general version of the game called ”Race to n,” where n is a positive integer greater than 0. What are the conditions on n such that the game has a first mover advantage? What are the conditions on n such that the game has a second mover advantage?
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
Alice and Betsy are playing a game in which each can play either of two strategies, leave or stay. If both play the strategy leave, then each gets a payoff of $400. If both play the strategy stay, then each gets a payoff of $800. If one plays stay and the other plays leave, then the one who plays stay gets a payoff of $C and the one who plays leave gets a payoff of $D. When is the outcome where both play leave a Nash equilibrium? a) never, since 800 > 400 b) when 400 > C and D > 800 but not when 800 > D c) whenever 400 > C d) when D > C and C > 400 e) whenever d < 800
1. Dave Grohl wants to buy drums and guitars. Drums are sold in an unusual way. There is only one supplier, and the more drums you buy from him, the higher the price you have to pay per unit. In fact, y units of drums will cost Dave y² dollars. Guitars are sold in the usual way at a price of 2 dollars per unit. Dave's income is 20 dollars, and his utility function is U (x,y) = x+2y, where x is his consumption of guitars and y is his consumption of drums. A. Sketch Dave's budget set and shade its in. B. Sketch some of his indifference curves and label the point that he chooses. C. Calculate the number of drums and guitars that Dave demands at these prices and this income.
Consider the following sequential-move game: This game involves three players, each making sequential decisions. The game proceeds as follows: • Player 1 initiates the game by choosing between two actions: Left and Right. • Depending on Player 1's choice, Player 2 then decides, choosing between two actions, left (I) and right (`r`). • Finally, Player 3 makes the last move in the sequence, choosing between actions `a` and `b`. The payoffs are determined by the sequence of choices made by all three players. Each payoff is represented by the triplet (x,y,z), where x, y, and z denote the payoffs for Player 1, Player 2, and Player 3, respectively. For example, if Player 1 chooses 'Left', Player 2 chooses 'I', and Player 3 chooses `a` the resulting payoff would be (3,1,2). This indicates that Player 1 receives a payoff of $3, Player 2 receives a payoff of $1, and Player 3 receives a payoff of $2 for this particular sequence of actions. Left Player 2 Player 1 Right Player 2 Player 3 Player 3…
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
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?
The “research and development” game is best analyzed as a simultaneous move game, because the parties lack information about each other’s investment decisions. Which game (in the attachment) describes the “research and development game” properly? Remember that investment costs $6, and that this should be reflected, whenever appropriate, in the correct game matrix. (Note: Firm A chooses the row and Firm B chooses the column.)
Consider the following game. You will roll a fair, 6-sided die either once or twice. You decide whether to do the second roll after you see how the first one lands. The payoff is $n, where n is the outcome of the last roll. For example, if the first roll lands 4 and the second lands 2, you win $2. If you only do one roll and it lands 4, you win $4. Suppose you make your decision about whether to go for a second roll based on expected monetary value. Then you will go for a second roll if (and only if) the first roll lands x or lower. What is x?
in game theory, when are there player 1 and palyer 2 and the payoff function is as follow (if player 1 get to choose first) (u1, u2). my question is if the order change like player 2 get to choose first, will the order of the payoff change as well like (u2, u1)?