2. Cindy and Andy are both workers on a team. At the same time both workers can choose to work on the risky project (R) or the safe project (S). If both choose to work on the R project the payoffs are 5 to Cindy and 4 to Andy. If both work on the S project the payoffs are 4 to Cindy and 5 to Andy. If Cindy works on R and Andy on S, the payoffs are (8, 10) to Cindy and Andy respectively. Finally, if Cindy plays S and Andy plays R, the payoffs are (10, 7). a. What are the Nash equilibria of the game? Interpret your equilibria in terms of a firm using teams. b. Now assume that Cindy can move first and choose which project to work on. Andy observes Cindy's choice before making his choice of either R or S. What are the subgame perfect equilibria of the game? Interpret this sequential game in terms of

2. Cindy and Andy are both workers on a team. At the same time both workers can choose to work on the risky project (R) or the safe project (S). If both choose to work on the R project the payoffs are 5 to Cindy and 4 to Andy. If both work on the S project the payoffs are 4 to Cindy and 5 to Andy. If Cindy works on R and Andy on S, the payoffs are (8, 10) to Cindy and Andy respectively. Finally, if Cindy plays S and Andy plays R, the payoffs are (10, 7). a. What are the Nash equilibria of the game? Interpret your equilibria in terms of a firm using teams. b. Now assume that Cindy can move first and choose which project to work on. Andy observes Cindy's choice before making his choice of either R or S. What are the subgame perfect equilibria of the game? Interpret this sequential game in terms of

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.9P

See similar textbooks

Similar questions

you and a friend decide to run a three mile race. If you agree to run together, you keep up with himfor the first mile, but you overexert yourself and run the last two miles at slower paces on your own. Tomake up for lost time, your friend runs the last two miles at a faster pace. Your mile times are 6:30, 7:00,and 7:30. Your friend’s times are 6:30, 6:00, and 6:00. If you both agree to run on your own, you run aconstant pace of 7:05 while your friend runs at a constant pace of 6:05. If you want to run together butyour friend wants to run solo, he runs his constant pace of 6:05. You, on the other hand, want to showhim that you can run faster, but you end up overexerting yourself after the first mile. You run times of6:20, 7:05, and 7:30. If he wants to run together but you do not, you both run at your pace of 7:05. Thissituation can be turned into an economic game, with the payoffs the overall race times. You each wantto run the fastest time you possibly can.(a) Who are the players in…
You and a coworker are assigned a team project on which your likelihood or a promotion will be decidedon. It is now the night before the project is due and neither has yet to start it. You both want toreceive a promotion next year, but you both also want to go to your company’s holiday party that night.Each of you wants to maximize his or her own happiness (likelihood of a promotion and mingling withyour colleagues “on the company’s dime”). If you both work, you deliver an outstanding presentation.If you both go to the party, your presentation is mediocre. If one parties and the other works, yourpresentation is above average. Partying increases happiness by 25 units. Working on the project addszero units to happiness. Happiness is also affected by your chance of a promotion, which is depends on howgood your project is. An outstanding presentation gives 40 units of happiness to each of you; an aboveaverage presentation gives 30 units of happiness; a mediocre presentation gives 10 units…
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?
Consider a situation of after-match penalty shoot-out. The striker can target either East or West side of the goal. If he targets West, with 80% chance he shoots on target. If he shoots East, he is accurate with 75%. The goalkeeper has to choose the corner to jump to. If he does not guess the corner correctly and the shot is on target, then the striker scores. If the striker shoots West, the shot is on target and the goalkeeperjumps West, then with 75% chance he saves the goal. If the striker shoots East, the shot is on target and the goalkeeper jumps East, then with chance of 2/3 he saves the goal. Suppose, that it is a zero-sum game and if the striker scores his payoﬀ is 1, otherwise it is 0.1. Formulate this situation as a strategic game and Find all Nash equilibria of the game.
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.
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.
6 Two people will select a policy that affects both of them by applying a "veto" in a sequential and alternate manner, that is: person 1 begins to veto a policy and then person 2 exercises his "veto" with the remaining policies; the process repeats until only one policy remains. Assume that there are 3 policies: X,Y,Z, and that person 1 prefers X to Y to Z and person 2 prefers Z to Y to X. a. Represents the game extensively b. Give the number of subgames C. Indicate the total strategies of the players d. find all subgame perfect nash equilibria e. Find all Nash Equilibriums.
Suppose that the University of Alabama and Clemson are making spending decisions for theupcoming year. Assume that Alabama is currently spending $15 million on their recruiting andfacilities, and Clemson is spending $10 million. Each team has an additional $5 million to spendor keep as profits. If they both choose to not spend the additional $5 million then Alabama hasa 60% chance of getting the highest quality quarterback recruit to commit to them (getting thecommitment of the player is the goal). However, if they both choose to spend the additional $5million then there is a 57% chance that Alabama gets the high quality quarterback to commit. IfAlabama spends the additional $5 million but Clemson doesn’t then there is a 67% chanceAlabama gets the recruit. However, if Alabama does NOT spend the additional $5million butClemson does then there is a 50% change either team gets the recruit’s commitment. Setup thepayoff matrix and label the players, their strategies, and their payoffs, and…
1. Solve for the mixed strategy Nash equilibrium of the game above. Explain carefully how you solve for it. 2. In the equilibrium you calculated above, what is the probability that both consoles are released in October? In December? What are the expected payoffs of firm A and of firm B in equilibrium?
Which of the following gambles is “unfair”? a. A game that promises to pay you $1 if a coin comes up head and cost you $1 if a coin comes up tail, with no entry fee. b. A game that promises to pay you $10 if a coin comes up head and cost you $1 if a coin comes up tail, with no entry fee. c. A game that promises to pay you $10 if a coin comes up head and cost you $1 if a coin comes up tail, with an entry fee of $4.50 for the right to play. d. All of the above.
1. What is the expected value of playing this game ? a. The player repeatedly rolls a six - side d die until it comes up 6. b. When the die comes up 6 , the player receives a payoff, and the game ends. The player get s precise ly one payof f. c. The initial payoff is $6, and it increases by 20%. The f irst roll payoff is $6 ; the second roll payoff is $7.20 (1.2*$6) ; the third roll payoff is $8.64 (1.2*$7.20), and so on. What is the expected value of playing this game?
Keith and Blake play a simultaneous one-shot game. Keith chooses between Top and Bottom, whereas Blake chooses between left and right. Payoffs are given by (Keith's payoffs are listed first and Blake's payoffs second): Top+left: 3,-6. Top+right:0,-7 Bottom+left:4,0. Bottom+right:-2,6. In a mixed strategy equilibria, Keith will play Top with what probability? 1. 6/7 2. 1/4 3. 1/2 4. 1/7 5. 0 6. 3/4