2. Consider the following "centipede game." The game starts with player 1 choosing be- tween terminate (T) and continue (C'). If player 1 chooses C, the game proceeds with player 2 choosing between terminate (t) and continue (c). The two players choose be- tween terminate and continue in turn if the other player chooses continue until the terminal nodes with (player l's payoff, player 2's payoff) are reached as shown below. Player 1 Player 2 Player 1 Player 2 (3, 3)| (1, 1) (0, 3) (2, 2) (1, 4)

2. Consider the following "centipede game." The game starts with player 1 choosing be- tween terminate (T) and continue (C'). If player 1 chooses C, the game proceeds with player 2 choosing between terminate (t) and continue (c). The two players choose be- tween terminate and continue in turn if the other player chooses continue until the terminal nodes with (player l's payoff, player 2's payoff) are reached as shown below. Player 1 Player 2 Player 1 Player 2 (3, 3)| (1, 1) (0, 3) (2, 2) (1, 4)

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

In the game shown below, Player 1 can move Up or Down, and Player 2 can move Left or Right. The players must move at the same time without knowledge of the other player’s move. The first payoff is for the row player (Player 1) and the second payoff is for the column player (Player 2). Solve each game using game theoretic logic. Player 2 Player 1 Left Right Up 7, 7 2, 9 Down 9, 2 1, 3
New answers
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?
PLAYER B LEFT RIGHT UP 5 FOR A, 30 FOR B 10 FOR A, 12 FOR B PLAYER A DOWN -2 FOR A, 10 FOR B 8 FOR A, 15 FOR B In the above game, the players are seeking to maximize the number they recieve. They choose at the same time. What is the Nash equillibrium? Player A will choose UP and player B will choose LEFT Player A will UP and player B will choose RIGHT Player A will choose DOWN and player B will choose LEFT Player A will choose DOWN and player B will choose RIGHT Player A will choose LEFT and player B will choose UP Player A will choose LEFT and player B will choose DOWN Player A will choose RIGHT and player B will choose UP Player A will choose RIGHT and player B will choose DOWN
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
Rita is playing a game of chance in which she tosses a dart into a rotating dartboard with 8 equal-sized slices numbered 1 through 8. The dart lands on a numbered slice at random. This game is this: Rita tosses the dart once. She wins $1 if the dart lands in slice 1, $2 if the dart lands in slice 2, $5 if the dart lands in slice 3, and $8 if the dart lands in slice 4. She loses $3 if the dart lands in slices 5, 6, 7, or 8. (If necessary, consult a list of formulas.) (a) Find the expected value of playing the game. | dollars (b) What can Rita expect in the long run, after playing the game many times? O Rita can expect to gain money. She can expect to win dollars per toss. Rita can expect to lose money. She can expect to lose dollars per toss. O Rita can expect to break even (neither gain nor lose money).
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
Consider the following game played by four individuals, players 1, 2, 3, and 4. Each individual has $10,000. Each player can donate between $0 and $10,000 to build a public park that costs $20,000. If they collect enough money, they construct the park, which is worth $9,000 to each of them. However, if they collect less than $20,000, they cannot build a park. Furthermore, regardless of whether the park is built or not, individuals lose any donations that they make. a) Describe the Nash equilibria for a simultaneous game. What makes them equilibria? Hint: There are many equilibria, so you may want to use a mathematical expression! b) Suppose that players 1, 2, and 3, each donate $4,000 for the park. How much will player 4 donate and why. What are the resulting payoffs for the players? c) Suppose instead that player 1 donated first, player 2 second, player 3 third, and player 4 last. Furthermore, players could only donate in intervals of 1,000 (0, $1,000, $2,000, etc.). How much will…
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…
Consider the two-round bargaining game. The minimum the seller will sell his home for 188,000 and the maximum the buyer is willing to pay is $200,000. Both players know these two amounts and are bargaining over the difference (M=$1200). Assume the disagreement values are zero for both players. Player 1 moves first by making a proposal and Player 2 can accept and reject. If player 2 rejects Player’s 1 proposal, then Player 2 gets to make a proposal, which Player 1 can reject and accept. The game is then over. Suppose the both players discount the future income at the rate d=0.2 per period. That is, $0.20 now is equivalent to $1,00 received next round. Find the equilibrium for this 2-round game. a) Draw the game tree b) What is the sale price of home? c)Which player gets the larger share of M?
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?
We have a group of three friends: Kramer, Jerry and Elaine. Kramer has a $10 banknote that he will auction off, and Jerry and Elaine will be bidding for it. Jerry and Elaine have to submit their bids to Kramer privately, both at the same time. We assume that both Jerry and Elaine only have $2 that day, and the available strategies to each one of them are to bid either$0, $1 or $2. Whoever places the highest bid, wins the $10 banknote. In case of a tie (that is, if Jerry and Elaine submit the same bid), each one of them gets $5. Regardless of who wins the auction, each bidder has to pay to Kramer whatever he or she bid. Does Jerry have any strictly dominant strategy? Does Elaine?