Consider a variant of the ultimatum game we studied in class in which players have fairness considerations. The timing of the game is as usual. First, player 1 proposes the split (100 – x, x) of a hundred dollars to player 2, where x € [0, 100]. Player 2 observes the split and decides whether to accept (in which case they receive money according to the proposed split) or reject (in which case they both get 0 dollars). But now player i's utility equals to her monetary utility minus the disutility from unfairness proportional to the difference in the monetary outcomes. That is, given a final split (m1, m2), let u1(m1, m2) = m1 – B1(m1 – m2)² uj(m1, m2) = m2 – B2(m1 – m2)², where ß1, ß2 are parameters of the game indicating how strongly players care about fairness. Note that the case we considered in class corresponds to B1 = B = 0.

Consider a variant of the ultimatum game we studied in class in which players have fairness considerations. The timing of the game is as usual. First, player 1 proposes the split (100 – x, x) of a hundred dollars to player 2, where x € [0, 100]. Player 2 observes the split and decides whether to accept (in which case they receive money according to the proposed split) or reject (in which case they both get 0 dollars). But now player i's utility equals to her monetary utility minus the disutility from unfairness proportional to the difference in the monetary outcomes. That is, given a final split (m1, m2), let u1(m1, m2) = m1 – B1(m1 – m2)² uj(m1, m2) = m2 – B2(m1 – m2)², where ß1, ß2 are parameters of the game indicating how strongly players care about fairness. Note that the case we considered in class corresponds to B1 = B = 0.

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.8P

See similar textbooks

Similar questions

Consider the game of Chicken in which each player has the option to “get out of the way” and “hang tough” with payoffs: Get out of the way Hang tough Get out of the way 2,2 1,3 Hang tough 3,1 00 a. Find all pure strategy Nash equilibria, if they exist b. Let k be the probability that player 1 chooses “hang tough” and u be the probability that player two chooses “hang tough.” Find the mixed stragety Nash equilibria, if they exist
Suppose two players play a two-period repeated game, where the stage game is the normal-form game shown below. Is there a subgame perfect Nash equilibrium in which the players select (A, X) in the first period? If so, fully describe such equilibrium. If not, explain why not. Player 1 has choice A, B; Player 2 has choice X, Y, Z. Payoff: (A,X)-(5,7), (A,Y)-(2,4), (A,Z)-(3,8), (B,X)-(1,4), (B,Y)-(3,5), (B,Z)-(1,4)
Type out the correct answer ASAP with proper explanation of it In the Ultimatum Game, player 1 is given some money (e.g. $10; this is public knowledge), and may give some or all of this to player 2. In turn, player 2 may accept player 1’s offer, in which case the game is over; or player 2 may reject player 1’s offer, in which case neither player gets any money, and the game is over. a. If you are player 2 and strictly rational, explain why you would accept any positive offer from player 1. b. In reality, many players reject offers from player 1 that are significantly below 50%. Why
Consider the “trust game” discussed in class. The first player starts with a $100 endowment and chooses how much to give to the second player. The gift triples in value (i.e. if $20 is given, the second player receives $60). The second player then chooses how much to give back. The first player receives exactly how much is returned (i.e. if $40 is returned, the first player receives $40). The Nash equilibrium of the game is: Group of answer choices: -First player gives $100, second player returns nothing. -First player gives $50, second player returns $50. -First player gives $100, second player returns $300. -There is no Nash equilibrium of this game. -First player gives nothing, second player returns nothing.
Consider the following game. There are two payers, Player 1 and Player 2. Player 1 chooses a row (10, 20, or 30), and Player 2 chooses a column (10/20/30). Payoffs are in the cells of the table, with those on the left going to Player 1 and those on the right going to player 2. Suppose that Player 1 chooses his strategy (10, 20 or 30), first, and subsequently, and after observing Player 1’s choice, Player 2 chooses his own strategy (of 10, 20 or 30). Which of the following statements is true regarding this modified game? I. It is a simultaneous move game, because the timing of moves is irrelevant in classifying games.II. It is a sequential move game, because Player 2 observes Player 1’s choice before he chooses his own strategy.III. This modification gives Player 1 a ‘first mover advantage’. A) I and IIB) II and IIIC) I and IIID) I onlyE) II only
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.
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…
Suppose that Teresa and Caroline are both in the public eye. They get offers to sell secrets of the other to tabloids. If both keep the secrets, they are both better off than if they get exposed. If only one is exposed, the other person is better off than if no one was exposed. Their payoffs from each option are given in the payoff matrix. Suppose that Caroline and Teresa play the game over four television seasons, where each season is a new game. Consider the scenarios. Remember, a tit‑for‑tat strategy is one where the person starts by cooperating and then plays whatever strategy the other firm played last. Over four seasons, how much will Caroline make if she and Teresa both play tit‑for‑tat? $_______ Over four seasons, how much does Caroline make if she always exposes and Teresa plays tit‑for‑tat? $________
Suppose that Teresa and Caroline are both in the public eye. They get offers to sell secrets of the other to tabloids. If both keep the secrets, they are both better off than if they get exposed. If only one is exposed, the other person is better off than if no one was exposed. Their payoffs from each option are given in the payoff matrix. Suppose that Caroline and Teresa play the game over four television seasons, where each season is a new game. Consider the scenarios. Remember, a tit‑for‑tat strategy is one where the person starts by cooperating and then plays whatever strategy the other firm played last. Over four seasons, how much will Caroline make if she plays a tit‑for‑tat strategy and Teresa always exposes? $_______ Over four seasons, how much will Caroline make if she and Teresa both always expose? $_________ Does Caroline have a dominant strategy when she and Teresa play for four seasons? No, there is no dominant strategy…
10 1. Consider the game where initially She chooses between "Stay Home" and "Go Out". If She chooses "Stay Home" then She gets 2 and He gets 0. If She chooses "Go Out" then they each simultaneously choose "Movie" or "Concert" where the payoffs are 0,1 or 3 as in the Battle of the Sexes Game. What are the subgame perfect Nash Equilibria of this game ?
There are three players who must each choose an “effort” level from 1 to 7, that is, Si = {1, 2, 3, ..., 7}. The payoff for each player i is ui(si, s−i) = 10 max{s1, s2, s3} − si. How many pure- strategy Nash equilibria are there? Select one: a.2 b.4 c.none of the other answers d.3 e.1
If the players play pure strategies, the game has no Nash equilibrium. But what if they choose their moves randomly? Let each player instead opt for a mixed strategy instead of a pure strategy. The first will play action Z with probability p, and the second will play action L with probability q. At which pair (p, q) are the mixed strategies of the players in equilibrium? At which pair (p, q) does neither player want to change strategy? When are both strategies simultaneously the best response?