2 Question C3. Two flatmates, Amy and Ben, decide each week whether to clean their flat or not. Theirpayoffs are described below:BenCleanDon't CleanClean(30,30)(5,35)AmyDon't Clean(35,5)(6,10)a) Define what the tit-for-tat strategy is in the context of the game outlined above.b) Suppose that the flatmates make their decision in order to maximise their discounted utilitywith a discount factor of 8. Compute the present value for each player when they follow thetit-for-tat strategy and when that player chooses their best alternative strategy.c) For what values of & can the tit-for-tat strategy support an outcome where both flatmatesclean every week?

Tit for Tat strategy game refers to that game in which both the players copy other's strategy if any…

Question C3. Two flatmates, Amy and Ben, decide each week whether to clean their flat or not. Their payoffs are described below: Ben Clean Don't Clean Clean (30,30) (5,35) Amy Don't Clean (35,5) (6,10)

Question C3. Two flatmates, Amy and Ben, decide each week whether to clean their flat or not. Their payoffs are described below: Ben Clean Don't Clean Clean (30,30) (5,35) Amy Don't Clean (35,5) (6,10)

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.9P

See similar textbooks

Similar questions

し(5,3) b I(2,2) も(0,0) (4,12) a (12.4) (0,0) i). List all subgame pertect Nash equilibria and name one Nash eqvilibrivm that is not subgame pertect i). How many strategies does playot and player 2 have?
Which is the correct mixed strategy Nash equilibrium for the below game? A B Confess Confess (3,2) Doesn't (0,0) confess a. (2/5); (3/5) b. (1/4); (3/4) c. (1/2); (1/2) d. (1/3); (2/3) Doesn't confess (0,0) (2,3)
(The Beckhams' dilemma) Victoria and David are husband and wife. They both prefer ciean to dirty house but neither likes to clean the house. Their payoffs are given in the table below. Victoria Clean Don't clean 0,8 Clean 5,5 David Don't clean 8,0 1,1 a) Let say they play the clean house game only once, what is the Nash equilibrium? b) Let say Victoria and David has to decide whether to clean or not every day for indefinite number of days. How grim-trigger strategy will be our subgame perfect Nash equilibrium? In other words, what is the patience rate that ensure Victoria and David maintain the cleanliness of the house?
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.
3.Students A and B decide whether to clean the dormitory. Regardless of whether the other party participates, the cleaning cost for each student to clean the dormitory is $ 8; and the benefit for each student from cleaning is $5 times the number of participants. (hint: if both of them clean the dormitory together, A and B benefit. If one cleans while the other does not, A and B benefit too) (a) Please use a game theory to briefly describe the above scenario, (that is to calculate the revenue for different strategies) (b) Draw the payoff matrix, find the Nash equilibrium.
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
Two workers are on a production line. They each have two actions: exert effort, E, or shirk, S. Effort costs a worker e > 0 and shirking costs them nothing. If two workers do action E a lot of output is produced and the workers earn £3 each. If only one worker chooses action E less output is produced and they both earn £1. The workers earn nothing if they both shirk. (i) Describe this situation as a strategic form game (assuming the workers do not observe each other's effort choice when making their own decision). (ii) For what values of e does this game have strictly dominant strategies? (iii) Describe the Nash equilibria of this game for e = 0,1, 2, 3. (iv) The workers now are re-arranged into a production line. First worker 1 moves and then worker 2 moves. Worker 2 can now see worker l's effort level before they choose their effort. Draw this extensive form game. (v) Find the subgame perfect equilibria of the production-line game for c = 1/2 and c = 3/2.
Exercise 6.8. Consider the following extensive-form game with cardinal payoffs: 1 R O player pay 000 2 1 M 3 b 010 O player 3's payoff 1 2 221 2 000 0 0 (a) Find all the pure-strategy Nash equilibria. Which ones are also subgame perfect? (b) [This is a more challenging question] Prove that there is no mixed-strategy Nash equilibrium where Player 1 plays Mwith probability strictly between 0 and 1.
2. Brad and Angelina have agreed to meet up for their first date. Neither of them can remember the exact location where they arranged to meet up and have forgotten their phones at home. Their payoff matrix can be described as follows: Brad The Hive Le Monde a) What is the Nash equilibrium in this game? Angelina The Hive 5; 5 0; 0 Le Monde 0; 0 5; 5
Aedri Quick Lesson in Game Theory A Nash Equilibrium is an outcome in which neither player is better off by changing their strategy. 2.7 Is a Dominant Strategy equilibrium also a Nash equilibrium? a) Yes b) No esc The Ice Cream Guys $3.99 $4.99 + Chucky's Chunky CCT: $20,000 $3.99 ICG: $20,000 CCT: $60,000 ICG: $10,000 tab Treats CCT: $10,000 $4.99 ICG: $60,000 CCT: $40,000 ICG: $40,000 The table above is the payoff matrix for the annual profit of the only two ice-cream-truck firms operating in Beach City. They are deciding the price of an ice cream cone. %3D caps lo 2.8 What is Chucky's dominant strategy? a) $3.99 b) $4.99 c) Not enough information hift 2.9 What is the dominant strategy equilibrium in this situation? a) Both charge $3.99 b) Both charge $4.99 c) CCT charges $3.99 and ICG charges $4.99 d) CCT charges $4.99 and ICG charges $3.99 2.10 Suppose these two firms engaged in collusion (which, of course, totally doesn't happen because it is against the law). Which outcome would…
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…
1. Nash Equilibrium (a) Find all pure Nash Equilibria P1/P2 W X Y Z 9,9 0,7 5,5 1,1 7,0 0,0 4,2 7,7 5,5 2,4 0,0 1,1 1,1 7,7 1,1 0,0 A B C D (b) Consider the following picnic game. There are N players in the game each who can chose to bring food to the picnic or not. Let b;= {0, 1} be player i's choice of bringing food with 0 as not and 1 as yes. If they decide to bring food it comes at a cost c;(1) = 1 and no cost to bring food. Payoffs are sum of food brought minus individual cost. i. Write out the normal form matrix if N = 2 ii. If N = 2 find all pure Nash Equilibria iii. Find all pure Nash Equilibria in the general game