(1) Yes, For player 1 "F" dominated by "D" and for player 2 "C" dominated by "A".
(2) A prudent strategy maximizes a player’s minimum possible pay-off. Player 1’s (pure) prudent strategy is D. Player 2’s (pure) prudent strategy is A.
(3) No, there have no saddle-points in pure strategies. Because there is no common value of Max-Min and Min-Max.
Max-Min Min-Max
Consider the game: 312 1 1) Does either player have a dominated strategy? 2) Does either...
Exercise 4 - Pure strategies that are only strictly dominated by a mixed strategy Consider the following normal form game Player 2 Left Right Player 1 4,1 Down 13 12 b) Is there some strictly dominated strategy for player 1 when mixed strategies are allowed? [Hint: 0,2 4,1 Middle0,0 a) c) d) Is there some strictly dominated strategy for player 1 involving only the use of pure strategies? you may assign probabilities to two of her strategies, similarly as we...
1 Consider the following normal-form game. P2 L CR P M (a) Does Pl (player 1) have any dominated strategies? (b) Does P2 (player 2) have any dominated strategies? (c) Suppose l2 beleves that Pl is rational, should P2 believe P1 will ever play B? (d) Suppose player P2 rales out the possibility that Pl plays B, is there a dominated ECON 306 Page 2 of 12 2018 strategy for player P2? (e) Can yoa find any more eliminated strategies...
4. Consider the following game matrix: LCR T 3 ,1 0,0 4,1 M10, 02, 24, 3 B 7,6 | 1,2 3,1 (a) Find all the strictly dominated (pure) strategies for each player. (b) Find all the weakly dominated (pure) strategies of each player. (c) Does the game has a strict dominant strategy equilibrium?
a) Eliminate strictly dominated strategies.b) If the game does not have a pure strategy Nash equilibrium,find the mixed strategy Nash equilibrium for the smaller game(after eliminating dominated strategies). Player 2Player 1abcA4,33,22,4B1,35,33,3
Problem 1. Consider the following extensive form game. 2 > 2,3 4,1 3,2 1.2 (a) By converting the game into normal form game (by finding the corre- sponding bimatrix game), find all Nash equilibrium in pure strategies. (b) Does player 2 have a strictly dominated strategy?
Player lI A 6,6 2,0 В 0,1 а,а Player Consider the game represented above in which BOTH Player 1 and Player 2 get a payoff of "a" when the strategy profile played is (B,D). Select the correct answer. If a-1 then strategy B is strictly dominated If a-3/2 then the game has two pure strategy Nash Equilibria. For all values of "a" strategy A is strictly dominant. For small enough values of "a", the profile (A,D) is a pure strategy...
) Solve the game below by iterated elimination of strongly dominated strategies (Hint: One of the pure strategies for player 1 is strongly dominated by a mixed strategy). At each step of the elimination, state which pure strategy you are eliminating and which strategy (there can be more than one; just state one) it is strongly dominated by. X Y Z A 5,-2 0,1 6,0 B 2,8 2,3 1,4 C 0,0 7,1 -2,0
Question 1 a) First consider the following game, where each player plays either C (Confess) or D (Deny) and the numbers in brackets are the respective payoffs to player 1 and player 2. Player 2 Player 1 (0-12) (-12,0) In relation to the above game outline the concepts of - Dominated strategies - Best responses - Nash equilibrium/equilibria - A prisoner's dilemma b) Define what is meant by subgame perfection and how the concept of credibility can be used to...
(20 points) Exercise 3: (Midterm 2018) Consider the following normal-form game, where the pure strategies for Player 1 are U, M, and D, and the pure strategies for Player 2 are L, C, and R. The first payoff in each cell of the matrix belongs to Player 1, and the second one belongs to Player 2. Player 2 IL CR u 6,8 2,6 8,2 Player 1 M 8,2 4,4 9,5 8,10 4,6 6,7 (7) a) Find the strictly dominated (pure)...
4. Consider the game below. P2's strategy C is a dominated strategy. True or False? Show why. Your mark depends on your explanation. (2 points) Player 2 A B C Player 1 Up 1,4 2,1 1,3 Down 2,2 2,5 5,3