In this version of the ultimatum game experiment, one participant is given £100, and is told to offer to split that amount with another participant. The second player can either refuse to accept the division, in which case the participant receiving the £100 has to give it back, or can accept the division, in which case, the player receiving the money splits the £100 as proposed. For the participant who has to accept or reject the offer A) The best strategy is to accept any offer which meets the social norm for fairness. B) The best strategy is to threaten to turn down any transfer of less than £100 to ensure that the person receiving the money makes a fair offer. C) There is a dominant strategy to accept any offer because gaining some money is better than gaining no money D) There is a dominant strategy to turn down any offer other than £50 because an unequal split would be unfair.

In this version of the ultimatum game experiment, one participant is given £100, and is told to offer to split that amount with another participant. The second player can either refuse to accept the division, in which case the participant receiving the £100 has to give it back, or can accept the division, in which case, the player receiving the money splits the £100 as proposed. For the participant who has to accept or reject the offer A) The best strategy is to accept any offer which meets the social norm for fairness. B) The best strategy is to threaten to turn down any transfer of less than £100 to ensure that the person receiving the money makes a fair offer. C) There is a dominant strategy to accept any offer because gaining some money is better than gaining no money D) There is a dominant strategy to turn down any offer other than £50 because an unequal split would be unfair.

Managerial Economics: A Problem Solving Approach

5th Edition

ISBN:9781337106665

Author:Luke M. Froeb, Brian T. McCann, Michael R. Ward, Mike Shor

Publisher:Luke M. Froeb, Brian T. McCann, Michael R. Ward, Mike Shor

Chapter15: Strategic Games

Section: Chapter Questions

Problem 2MC

See similar textbooks

Similar questions

The ultimatum game is a game in economic experiments. The first player (the proposer) receives a sum of money and proposes a fair proposal (F - 5;5) or unfair proposal (U - 8;2). The second player (the responder) chooses to either accept (A) or reject (R) this proposal. If the second player accepts, the money is split according to the proposal. If the second player rejects, neither player receives any money. 1 A 5:5 2 F R 0:0 U A 8:2 2 1. Find the subgame perfect Nash Equilibrium using backward induction. R 0;0
Two players bargain over 1 unit of a divisible object. Bargaining starts with an offer of player 1, which player 2 either accepts or rejects. If player 2 rejects, then player 1 makes another offer; if player 2 rejects once more, then player 2 makes an offer. If player 1 rejects the offer of player 2, then once more it is the turn of player 1 where he makes two consecutive offers. As long as an agreement has not been reached this procedure continues. For example, suppose that agreement is reached at period 5, it follows that player 1 makes offers in period 1,2 then player 2 makes an o er in period 3, then player 1 makes offers in 4,5. Negotiations can continue indefinitely, agreement in period 't' with a division (x, 1- x) leads to payoffs ( , (1-x)).(The difference from Rubinstein's alternating offer bargaining is that player one makes two consecutive offers, whereas player 2 makes a single offer in her turn.) a. Show that there is a subgame perfect equilibrium in which player 2's…
Suppose two bidders compete for a single indivisible item (e.g., a used car, a piece of art, etc.). We assume that bidder 1 values the item at $v1, and bidder 2 values the item at $v2. We assume that v1 > v2. In this problem we study a second price auction, which proceeds as follows. Each player i = 1, 2 simultaneously chooses a bid bi ≥ 0. The higher of the two bidders wins, and pays the second highest bid (in this case, the other player’s bid). In case of a tie, suppose the item goes to bidder 1. If a bidder does not win, their payoff is zero; if the bidder wins, their payoff is their value minus the second highest bid. a) Now suppose that player 1 bids b1 = v2 and player 2 bids b2 = v1, i.e., they both bid the value of the other player. (Note that in this case, player 2 is bidding above their value!) Show that this is a pure NE of the second price auction. (Note that in this pure NE the player with the lower value wins, while in the weak dominant strategy equilibrium where both…
Consider the charity auction. In many charity auctions, altruistic celebrities auction objects with special value for their fans to raise funds for charity. Madonna, for example, held an auction to sell clothing worn during her career and raised about 3.2 million dollars. In the charity auction the winner of the lot is the highest bidder. The difference with the standard auction is that all bidders are required to pay an amount equal to what they bid. Suppose there are two bidders and assume bidders have valuations randomly drawn from the interval [2, 4] according to the uniform distribution. 1. Derive the equilibrium bidding function. Hint: After getting the differential equation given by the FOC, propose a non-linear bidding function b(v) = α + βv2 as solution. Your task is to find α and β. 2. Derive the revenue of the seller in the charity auction. 3. Would the seller obtain higher profits if she organized a first-price sealed bid auction instead? A. Yes, higher revenue B. No, lower…
Jesse and Janie are playing a game. On the table in front of them, there are 50 coins. They take turns removing some of these coins from the table. At each turn, the person moving can remove either 1,2,3,4,5,6, or 7 coins (they cannot remove 0 or 8, etc.). The person to remove the last coin wins. Suppose Janie is the first player to have a turn (a) In the subgame perfect equilibrium, Janie begins by taking _________coins (b) Suppose Janie makes a mistake in play and removes a number of coins that leaves 27 coins on the table when it is jesses turn. To have a chance at winning, Jesse should remove _________ Coins
David wants to auction a painting, and there are two potential buyers. The value for eachbuyer is either 0 or 10, each value equally likely. Suppose he offers to sell the object for $6, and the two buyers simultaneously accept or reject. If exactly one buyer accepts, the object sold to that person for $6. If both accept, the object is allocated randomly to the buyers, also for $6. If neither accepts, the object is allocated randomly to the bidders for $0. (a) Identify the type space and strategy space for each buyer. (b) Show that there is an equilibrium in which buyers with value 10 always accept. (c) Show that there is an equilibrium in which buyers with value 10 always reject.
In 'the dictator' game, one player (the dictator) chooses how to divide a pot of $10 between herself and another player (the recipient). The recipient does not have an opportunity to reject the proposed distribution. As such, if the dictator only cares about how much money she makes, she should keep all $10 for herself and give the recipient nothing. However, when economists conduct experiments with the dictator game, they find that dictators often offer strictly positive amounts to the recipients. Are dictators behaving irrationally in these experiments? Whether you think they are or not, your response should try to provide an explanation for the behavior.
Tom and Jerry are each given one of two cards. One card is blank, while the other has a circle on it. A player can draw a circle on the blank card or erase the circle on one that has already been drawn. Tom and Jerry make their decision separately and hand in the card at the same time.Nobody wins anything unless the two cards are handed in with one and only one circle on them. The player who hands in the card with the circle receives $20, while the one who hands in the blank card receives $10. Answer the following questions. (1) Represent the game in strategic form.(2) Find the Nash equilibria of the game (in pure strategies).
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.
A crime is witnessed by 3 citizens. Every citizen would like the police to be informed about the crime, but prefers that someone else reports it (filing a report is a hassle). Each of the three citizens chooses simultaneously (and independently) whether to call the police or not. When no one makes a call, every citizen receives payoff 0. If at least one citizen calls the police, citizens who call get payoff 5, and those who don't call get payoff 9. (a) Find all Nash equilibria in pure strategies. (b) Compute a symmetric Nash equilibrium in mixed strategies (i.e., an equilibrium in which every citizen calls with the same probability p E (0, 1)). (c) Does the game have a Nash equilibrium in pure or mixed strategies different from those you identified in (a) and (b)? If yes, construct one. If not, argue why not.
Brett and Oliver are both going surfing. Each can choose between "North Beach" (N) and "South Beach" (S). North beach is better, but they both also prefer having the beach to themselves rather than sharing it with the other person. If Brett chooses N and Oliver N, the payoffs are (60, 60). If Brett chooses N and Oliver Chooses S, the payoffs are (70,30). If Brett chooses S and Oliver N the payoffs are (30,70). If they both choose S the payoffs are (20,20). Brett gets to choose first and tells Oliver, who then makes a decision. Which of the following is true? O The number of nash equillibrium in this game is less than the number of subgame perfect equillibrium O The number of nash equillibrium in this game is the same as the number of subgame perfect equillibrium O The number of nash equillibrium in this game is more than the number of subgame perfect equillibrium O There is no subgame perfect equilibrium in this game
The count is three balls and two strikes, and the bases are empty. The batter wants to maximize the probability of getting a hit or a walk, while the pitcher wants to minimize this probability. The pitcher has to decide whether to throw a fast ball or a curve ball, while the batter has to decide whether to prepare for a fast ball or a curve ball. The strategic form of this game is shown here. Find all Nash equilibria in mixed strategies.