Asap within 30 minutes 1. Consider the following version of the Prisoners' Dilemma.Player 2Player 1MF(−1,−1)(-9,0)F (0, -9) (-6, -6)M(a) For each mixed strategy person 2, determine person 1's best responses.(b) For each mixed strategy of person 1, determine person 2's best responses.(c) Find all of the mixed-strategy Nash equilibria of this game.

John von Neumann and Oskar Morgenstern established the idea of a mixed-strategy equilibrium, but…

1. Consider the following version of the Prisoners' Dilemma. Player 2 Player 1 M F M (−1,−1) (0, -9) F (-9,0) (-6, -6) (a) For each mixed strategy of person 2, determine person 1's best responses. (b) For each mixed strategy of person 1, determine person 2's best responses. (c) Find all of the mixed-strategy Nash equilibria of this game.

1. Consider the following version of the Prisoners' Dilemma. Player 2 Player 1 M F M (−1,−1) (0, -9) F (-9,0) (-6, -6) (a) For each mixed strategy of person 2, determine person 1's best responses. (b) For each mixed strategy of person 1, determine person 2's best responses. (c) Find all of the mixed-strategy Nash equilibria of this game.

Microeconomic Theory

12th Edition

ISBN:9781337517942

Author:NICHOLSON

Publisher:NICHOLSON

Chapter8: Game Theory

Section: Chapter Questions

Problem 8.1P

See similar textbooks

Similar questions

on 8.1 Consider the following game: Player 1 A C D 7,6 5,8 0,0 Player 2 E 5,8 7,6 1, 1 F 0,0 1,1 4,4 a. Find the pure-strategy Nash equilibria (if any). b. Find the mixed-strategy Nash equilibrium in which each player randomizes over just the first two actions. c. Compute players' expected payoffs in the equilibria found in parts (a) and (b). d. Draw the extensive form for this game.
1. Identify the Nash Equilibria and Subgame Perfect Nash Equilibria in pure strategy of this game. 2. Using beliefs (p, 1−p) at P2's decision nodes in their information set, show that one of the NE is not sequentially rational.
4. Correlated EquilibriaConstruct an example (not one from class or the reading) of a Normal form game with a correlated equilibrium that is not a Nash equilibrium.
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?
A game involves two players: player A and player B. Player A has three strategies a1, a2 and a3 while player B has three strategies b1, b2 and b3. Player B b1 b2 b3 a1 -40,30 70,20 -10,120 Player A a2 40,60 80,80 60,20 a3 -30,40 -50,110 150, -70 Assuming that this is a one-time game, answer the following questions: Is there any dominant strategy for each player? What is the secure strategy of each player. What is the Nash equilibrium of the game?
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.
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
E3 Bayesian Game]. Consider a Bayesian game described by a following payoff matrix. Please solve (show your solution). 1. Enumerate all pure strategies for each player. 2. Suppose that player 1 observes his type ?1 = 3. How does player 1 think of the probability of ?2? 3. Find a (pure strategy) Bayesian Nash equilibrium.
Answer all questions, show all working. Consider the following game in strategic or normal form. A2 B2 C2 A1 1,0 1,2 -2,1 B1 6,2 0,3 2,3 C1 2,2 -2,1 2,3 Use the iterative elimination of strictly dominated strategies to reduce the game as much as possible. What is the set of rationalizable strategies for each player? What is/are Nash equilibrium(s) in this game? Explain the differences between cooperative and non- cooperative games. What are the fundamental hypotheses about the behavior of the persons in Game theory?
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
John enjoys playing two-player zero-sum games. The matrix below shows the losses to John in a particular two-player zero-sum game. His strategies are denoted by I, II, and III, whereas the strategies for his opponent are denoted by A, B, and C. I II III A 3 2 4 B 0 1 1 C 1 3 0 (a) Explain which of John’s strategies is dominated.The opponent now has the option of a fourth strategy, D, which results in none ofJohn’s strategies being dominated.(b) Suggest possible values for the strategy D.
5 Consider a first-price sealed-bid auction in which bidders valuations are independently and identically distributed according to the Uniform distribution on the interval [0, 1]. Explain what the rules of the First Price Sealed bid auction are. Set it up as a Bayesian game. Compute a symmetric Bayesian Nash equilibrium for the two bidder case.