Find the SPNE for the centipede game. Centipede game: Two players, 1 and 2, take turns choosing one of two actions each time, continue or stop. They both start with $1 in their respective piles, and each time i says continue, $1 is taken away from his pile, and $2 are added to the other player's pile. The game automatically stops when both players have $100 in their respective piles.

Find the SPNE for the centipede game. Centipede game: Two players, 1 and 2, take turns choosing one of two actions each time, continue or stop. They both start with $1 in their respective piles, and each time i says continue, $1 is taken away from his pile, and $2 are added to the other player's pile. The game automatically stops when both players have $100 in their respective piles.

Microeconomics: Principles & Policy

14th Edition

ISBN:9781337794992

Author:William J. Baumol, Alan S. Blinder, John L. Solow

Publisher:William J. Baumol, Alan S. Blinder, John L. Solow

Chapter13: Between Competition And Monopoly

Section: Chapter Questions

Problem 10DQ

See similar textbooks

Similar questions

Game Theory Question A non-profit firm is on a local community online donation platform for a community event it wants to hold (only community members can donate via the website). The event will be held only if the non-profit firm collects $20,000 total from members of the community. Each member values the event at $500. Suppose that there are 100 community members. Community members can only donate by purchasing a lottery ticket from the firm. Each ticket costs $200 and only one ticket can be purchased per member. The proceeds will be collected by the firm. The lottery winner gets a premier meal at a local restaurant that's worth $100. Remember, the firm keeps all the donated money. If the amount of donations is less than $20,000, then the firm returns the donated money to the community members (since there'll be no event held but the lottery winner still gets to eat that fancy meal). If the donations sum up to $20,000, the community event will take place. What are the Nash…
Question 4. Zeynep and Mehmet will eventually play the following game. Mehmet L R U 3,1 0,0 Zeynep D 0,3 1,3 In a preliminary stage, Zeynep has already asked Mehmet to allow her to move first and proposed to pay him 1 unit of her own payoff in exchange. So Mehmet has to options: • If he accepts Zeynep's offer: they will play the sequential move version of the above game in which Zeynep moves first. Mehmet will receive 1 unit of utility more, and Zeynep will receive 1 unit of utility less (in any outcome of the game) compared to the payoffs given in the bimatrix. 2 • If he rejects Zeynep's offer: they will play the simultaneous move game. a. Represent this strategic interaction in a game tree. b. How many information sets does each player have? c. Characterize the set of pure strategies for both players. d. Present this game as a normal-form game, and characterize the set of pure strategy Nash equi- libria.
In a gambling game, Player A and Player B both have a $1 and a $5 bill. Each player selects one of the bills without the other player knowing the bill selected. Simultaneously they both reveal the bills selected. If the bills do not match, Player A wins Player B's bill. If the bills match, Player B wins Player A's bill. a. Develop the game theory table for this game. The values should be expressed as the gains (or losses) for Player A. b. Is there a pure strategy? Why or why not? Determine the optimal strategies and the value of this game. Does the game favor one player over the other? d. Suppose Player B decides to deviate from the optimal strategy and begins playing each bill 50% of the time. What should Player A do to improve Player A’s winnings? Comment on why it is important to follow an optimal game theory strategy. с.
The following table contains the possible actions and payoffs of players 1 and 2. Player 1 U M D L 2,10 2,5 8,7 Player 2 C 5,2 11,8 8,4 R 5,4 2,9 8,3 This is a simultaneous move game. In a pure strategy Nash equilibrium of this game, Player 1 receives a payoff of ✓and player 2 receives a payoff of If, instead of playing simultaneously, player 2 moves first, then in the Nash equilibrium player 1 receives a payoff of ✓and player 2 receives a payoff of
H2. One day, Sam and Ryan play odds/evens to see who gets the last doughnut. On command, they each extend one or two fingers. If the sum is odd Sam wins the doughnut, if the sum is even Ryan wins the doughnut. Suppose the payoff from winning the doughnut is 1 and the payoff from losing is 0. a) Illustrate this interaction as a game in matrix form. b) Suppose that Sam thinks that Ryan will play one finger for sure? What will Sam play? Does Sam have reason to think that Ryan will play one finger for sure? c) Do either of them have a strictly dominated strategy? d) Find the pure strategy Nash equilibria of the game, if any. e) Suppose that Sam thinks that Ryan will play one finger or two fingers with even odds. Will Ryan play one finger for sure, play two fingers for sure or play each strategy with even odds? Does Sam have good reason to believe that Ryan will play one finger or two fingers with even odds?
Sam and Sarah are thinking about getting married. However if either of them cheats on the other, they would get a payoff of 10, while the other person gets zero. If neither cheat, they stay with each other and get a payoff of 7 each and if both cheat, the relationship falls apart and each get a payoff of 1. What is the Nash equilibrium of this game? a. Cheat, Cheat b. Not cheat, Not cheat Sam cheats, Sarah doesn't Sarah cheats, Sam doesn't
Game theory Consider a simultaneous move game with two players. Player 1 has three possible actions (A, B, or C) and Player 2 has two possible actions (D or E.) In the payoff matrix below, each cell contains the payoff for Player 1 followed by the payoff for Player 2. Player 2 7. Player 1 A B C D -3, -3 0, -11 -4, 3 -11, E 0 -7, -7 -12, 0 (a) Identify any dominated strategies in this game. If there are none, state this clearly. (b) Identify any pure strategy Nash Equilibria in this game. If there are none, state this clearly
3. Suppose we play the following game. I give you $100 for your initial bankroll. At each time n, you decide how much of your current wealth to bet. You cannot borrow money. You can only play with the money I gave you in the beginning or any money that you have won so far. The game is simple. At each time n ≥ 1, you decide the amount to bet. I will roll a fair die. If the die comes up 1,2,3,..., or 5, you win; if the die comes up 6, then you lose. IOW, if you bet $10 on the first roll, you will either have $90 or $110 after the first roll. (a) Suppose you wish to maximize your profit on the first roll. How much should you bet? (Most of you will get this wrong.) (b) What is the expected profit on the first roll if your bet is b with 0 ≤ b ≤ 100? (c) Suppose you wish to maximize your expected profit on the first roll. How much should you bet? (d) Suppose you wish to maximize your expected profit betting on the nth roll. How much of your current wealth do you bet? (e) Let X₂, be your…
5. The following problem was first considered by John von Neumann and is a fundamentalresult game theory.A and B play the following game:A writes down either number 1 or number 2, and B must guess which one.If the number that A has written down is i and B has guessed correctly, B receives i units from A.If B makes a wrong guess, B pays 4/5 of a unit to A.First we consider the expected gain of player B.Suppose B guesses 1 with probability p and 2 with probability 1 −p.Let X1 denote B’s gain (or loss) in a game where A has written down 1.Let X2 denote B’s gain (or loss) in a game where A has written down 2.(a) Find the pmf of X1 and X2(b) Find B’s expected gain for these two cases, E[X1] and E[X2].(c) What value of p maximizes the minimum possible value of B’s expected gain?Now consider the expected loss of player ASuppose that A writes down 1 with probability q and 2 with probability 1 −q.Let Y1 be A’s loss (or gain) if B chooses number 1.Let Y2 be A’s loss (or gain) if B…
Game theory Consider a simultaneous move game with two players. Player 1 has three possible actions (A, B, or C) and Player 2 has two possible actions (D or E.) In the payoff matrix below, each cell contains the payoff for Player 1 followed by the payoff for Player 2. Player 2 7. Player 1 ہے A B C D -3, -3 0, -11 -4, 3 -11, E 0 -7, -7 -12, 0 (a) Identify any dominated strategies in this game. If there are none, state this clearly. (b) Identify any pure strategy Nash Equilibria in this game. If there are none, state this clearly.
UNIT 9 CHAPTER 5 In a gambling game, Player A and Player B both have a $1 and a $5 bill. Each player selects one of the bills without the other player knowing the bill selected. Simultaneously they both reveal the bills selected. If the bills do not match, Player A wins Player B's bill. If the bills match, Player B wins Player A's bill. Develop the game theory table for this game. The values should be expressed as the gains (or losses) for Player A. Is there a pure strategy? Why or why not? Determine the optimal strategies and the value of this game. Does the game favor one player over the other? Suppose Player B decides to deviate from the optimal strategy and begins playing each bill 50% of the time. What should Player A do to improve Player A’s winnings? Comment on why it is important to follow an optimal game theory strategy.
GAME UUU B1 Player B B2 A1 7,13 5, 10 A2 3,8 9,16 Player A A3 5,8 4,7 In Game UUU (see table above), assuming players move simultaneously, Player A choosing A1 and Player B choosing B3 is a Nash equilibrium. Player A choosing A3 and Player B choosing B2 is a Nash equilibrium. Both Player A choosing A1 and Player B choosing B1 and Player A choosing A2 and player B choosing B2 are Nash equilibria in pure strategies Player A choosing A1 and Player B choosing B2 is a Nash equilibrium.