Question

In: Economics

4.Consider a modified version of the divide the dollar game in problem (3) in which player...

4.Consider a modified version of the divide the dollar game in problem (3) in which player 2 can make a counteroffer if she does not accept player 1’s offer. After player 2 makes her counteroffer –if she does– player 1 can accept or reject the counteroffer. As before, if there is no agreement after the two rounds of offers, neither player gets anything. If there is an agreement in either round then each player gets the amount agreed to.Represent the game in extensive form using a game tree. Again, you must assign payoffs appropriately at the terminal nodes.

3. (Because the 2 questions are related)- Consider the following game of divide the dollar. There is a dollar to be split between two players. Player 1 can make any offer to player 2 in increments of 25 cents; that is, player 1 can make offers of 0 cents, 25 cents, 50 cents, 75 cents, and $1. An offer is the amount of the original dollar that player 1 would like player 2 to have. After player 2 gets an offer, she has the option of either accepting or rejecting the offer. If she accepts, she gets the offered amount and player 1 keeps the remainder. If she rejects, neither player gets anything. Represent the game in extensive form using a game tree. Note that here you must assign payoffs appropriately at the terminal nodes.

Solutions

Expert Solution

Since Player 2 makes the last counter offer, he will put up an offer of $1 for himself and 0 for player 1.

If Player 1 rejects, neither gets anything. So it is highly probable that Player 1 accepts the offer in spite of him not getting anything. If he rejects, the net payoff will be 0 to both. However, if he accepts, the net payoff will be $1.

Seeing this scenario, in the very first stage, Player 1 can propose $0 for himself and $1 for Player 2 which Player 2 will accept and that will be the end of the game.

Or player 1 can propose $1 for himself and $0 for player 2 which Player 2 will reject and the game will continue. So irrespective of what Player 1 suggests, since there is no discounting, so the game will continue till the last stage. The last person to make the offer gets $1 and the other gets $0. This will be the outcome irrespective of what happens in the stages proceeding the last stage.

If you found this helpful, please rate it so that I can have higher earnings at no extra cost to you. This will motivate me to write more.


Related Solutions

1. (a) Consider a modified version of the Monty Hall problem. In this version, there are...
1. (a) Consider a modified version of the Monty Hall problem. In this version, there are 8 boxes, of which 1 box contains the prize and the other 7 boxes are empty. You select one box at first. Monty, who knows where the prize is, then opens 6 of the remaining 7 boxes, all of which are shown to be empty. If Monty has a choice of which boxes to open (i.e. if the prize is in the box you...
1. (a) Consider a modified version of the Monty Hall problem. In this version, there are...
1. (a) Consider a modified version of the Monty Hall problem. In this version, there are 8 boxes, of which 1 box contains the prize and the other 7 boxes are empty. You select one box at first. Monty, who knows where the prize is, then opens 6 of the remaining 7 boxes, all of which are shown to be empty. If Monty has a choice of which boxes to open (i.e. if the prize is in the box you...
Consider a game in which a player shoots 3 free throws; if the player makes i...
Consider a game in which a player shoots 3 free throws; if the player makes i free throws, she draws one bill at random from a bag containing i + 1 ten-dollar bills and 5 − (i + 1) one-dollar bills. Let X be the number of free throws she makes and Y be the amount of money she wins and assume that she makes free-throws with probability 1/2. (a) Tabulate the marginal probabilities P(X = x) for x ∈...
Consider a game in which there are 3 people. Each player can either participate or not...
Consider a game in which there are 3 people. Each player can either participate or not participate in a revolution. If at least 2 people participate, the revolution succeeds. If the revolution succeeds, each player gets a benefit of B. If the revolution fails, each player gets a benefit of 0. Each player who participates bears a cost c < B, whether or not the revolution succeeds. (a) Write down each player’s best response correspondence. (b) Is it a Nash...
Consider the following two-player game, in which Player 1 is the IMF, and Player 2 is...
Consider the following two-player game, in which Player 1 is the IMF, and Player 2 is a debtor country. Reform Waste Aid 3, 2 -2, 3 No Aid -2, 1 0, 0 a) Compute all (pure and mixed) Nash equilibria. b) Do you think that the above game is the case of a resource curse? Interpret the game with a story of a resource curse.
Find the total number of Nash equilibria of the “divide a dollar” game.
Find the total number of Nash equilibria of the “divide a dollar” game.
Question 4: Jar Game Consider the following game: Players: 2 - We designate player #1 to...
Question 4: Jar Game Consider the following game: Players: 2 - We designate player #1 to be the one that starts with the jar. Actions: - Each round at the same time both players deposit between 1 to 4 pennies into the jar. - Then both players are able to count the pennies in the jar. - If there are 21 or more pennies, the person with the jar is the winner. - If there are 20 or less pennies,...
The game of Pig is a simple two-player dice game in which the first player to...
The game of Pig is a simple two-player dice game in which the first player to reach 100 or more points wins. How to play: Players take turns rolling one six-sided dice and following these rules: If the player rolls 2 through 6, then he/she can either a. “Roll Again” or b. “Hold” At this point, the sum of all rolls is added to the player’s score, and it becomes the other player’s turn. If the player rolls 1 before...
Problem 5 In the 1998 video-games Pokémon Red Version and Pokémon Blue Version, the player was...
Problem 5 In the 1998 video-games Pokémon Red Version and Pokémon Blue Version, the player was able to create their own party of one to six total “pocket monsters”. In these games, there were 151 species of Pokémon available for capture, and it was possible to fill a party with multiple monsters of the same species. Determine the following: a) Ignoring order, how many combinations of party Pokémon were possible in these games? b) If a Pokémon party were to...
Consider a game in which, simultaneously, player 1 selects any real number x and player 2...
Consider a game in which, simultaneously, player 1 selects any real number x and player 2 selects any real number y. The payoffs are given by: u1 (x, y) = 2x − x2 + 2xy u2 (x, y) = 10y − 2xy − y2. (a) Calculate and graph each player’s best-response function as a function of the opposing player’s pure strategy. (b) Find and report the Nash equilibria of the game. (c) Determine the rationalizable strategy profiles for this game.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT