(a) Stan and Ollie are two students who share a flat. Both of them prefer to liıve in à clean Ilal. However, neither is too fond of housecleaning. Each of them receives a payoff of 12 if they both clean the flat. If neither person cleans the flat, they receive a payoff of 6 each. If one person cleans the flat but the other person does not, then the payoff for the person who does the cleaning is 5 and the payoff for the person who doesn't do any cleaning is 15. (i) Write down the payoff matrix of this game. Derive the dominant strategy equilibrium. Is this also a Nash equilibrium? (ii) Expiain your reasoning.

(a) Stan and Ollie are two students who share a flat. Both of them prefer to liıve in à clean Ilal. However, neither is too fond of housecleaning. Each of them receives a payoff of 12 if they both clean the flat. If neither person cleans the flat, they receive a payoff of 6 each. If one person cleans the flat but the other person does not, then the payoff for the person who does the cleaning is 5 and the payoff for the person who doesn't do any cleaning is 15. (i) Write down the payoff matrix of this game. Derive the dominant strategy equilibrium. Is this also a Nash equilibrium? (ii) Expiain your reasoning.

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

Chapter18: Auctions

Section: Chapter Questions

Problem 4MC

See similar textbooks

Similar questions

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?
onsider the game described by the ff table. what is thE best response for the column player if he/she knows that the row player will make the Y move?
You and a rival are engaged in a game in which there are three possible outcomes: you win, your rival wins (you lose), or the two of you tie. You get a payoff of 50 if you win, a payoff of 20 if you tie, and a payoff of 0 if you lose. What is your expected payoff in each of the following situations? (a) There is a 50% chance that the game ends in a tie, but only a 10% chance that you win. (There is thus a 40% chance that you lose.) (b) There is a 50–50 chance that you win or lose. There are no ties. (c) There is an 80% chance that you lose, a 10% chance that you win, and a 10% chance that you tie.
Mohamed and Kate each pick an integer number between 1 and 3 (inclusive). They make their choices sequentially.Mohamed is the first player and Kate the second player. If they pick the same number each receives a payoff equal to the number they named. If they pick a different number, they get nothing. What is the SPE of the game? a. Mohamed chooses 3 and Kate is indifferent between 1, 2 and 3. b. Mohamed chooses 3 and Kate chooses 1 if Mohamed chooses 1, 2 if Mohamed chooses 2, and 3 if Mohamed chooses 3. c. Mohamed chooses 1 and Kate chooses 1 if Mohamed chooses 1, 2 if Mohamed chooses 2 and 3 if Mohamed chooses 3. d. Mohamed chooses 3 and Kate chooses 3.
What is the payoff for both players in the SPNE of this game?-(2,5)-(3,4)- (2,2)- (5,1)- (1,7)
. Ayça and Barış are playing a game and following payoff matrix is for the payoffs of Ayça. Answer the questions according to the following payoff matrix. a) What is the probability that the value of the game is 10?
In the coin game, two players begin with 13 coins. Players take turns to remove coins. At each turn each player is allowed to remove one, two, or three coins. The winner is the last player to remove coin(s). Suppose there are 9 coins remaining and it is your turn to remove coin(s). Your best strategy is to remove how many coins? a. 0 b. 1 c. 2 d. 3
5.Each of Player 1 and Player 2 chooses an integer from the set {1, 2, ..., K}. If they choose the same integer, P1 gets +1 and P2 gets -1; if they choose different integers, P1 gets -1 and P2 gets +1. (a) Show that it is a NE for each player to choose every integer in {1, 2, ..., K} with equal probability, K1 . (b) Show that there are no NE besides the one you found in (a).
A occurs if all players in a game play their best strategies given what their competitors do.
Two mining companies, Red and Blue, bid for the right to drill a field. The possible bids are $ 15 Million, $ 25 Million, $ 35 Million, $ 45 Million and $ 50 Million. The winner is the company with the higher bid.The two companies decide that in the case of a tie (equal bids), Red is the winner and will get the field.Company Red has ordered a geological survey and, based on the report from the survey, concludes that getting the field for more than $ 45 Million is as bad as not getting it (assume loss), except in case of a tie (assume win). 1)Considering all possible combinations of bids, formulate the payoff matrix for the game. 2) Verify: does the game have a saddle point? 3)
Determine the optimum strategies and the value of the game with the followingpayoff matrix of player A where A1, A2 are the strategies for player A and B1, B2 are for player B.B1 B2A1 5 1A2 3 4
Someone at a party pulls out a $100 bill and announces that he is going to auction it off. There are n=10 people at the partywho are potential bidders. The owner of the $100 bill puts forth the following procedure: All bidders simultaneously submit a written bid. Only the highest bidders pay their bid (assuming that the highest bid is positive). If m people submit the highest bid, then each receives 1/m of the $100. Each person’s strategy set is {0,1,2,...,1000}{0,1,2,...,1000} so bidding can go as high as $1,000. The payoff of a player bidding bi is:0 if bi < max{b1,b2,…,bn},and 100/m − bi if bi = max {b1,b2,…,bn}where,m is the number of bidders whose bid equals max{b1,...,bn}. How many pure-strategy Nash equilibria does this game have? 1) 0 2) 1 3) 4 4) More than 4.