(In this and all other questions in which a game matrix is given, Player 1 chooses the row, Player 2 chooses the column, and if there is a Player 3, she chooses the matrix.)Which is true for the following game according to the solution concept of iterated elimination of strongly dominated strategies?  A  B Ca  1,4  -2,-2   4,0b  6,2 -2,3 3,-6c 5,-1 -1,0 5,2d 0,0 0,3 5,4 The strategy profiles (c,C) and (d,C) solve the game. Player 1 is guaranteed a payoff of 6. Player 2 is guaranteed a payoff of 4. The unique strategy profile that solves the game is (b,A). The unique strategy profile that solves the game is (d,C). None of the other alternatives is true.

(In this and all other questions in which a game matrix is given, Player 1 chooses the row, Player 2 chooses the column, and if there is a Player 3, she chooses the matrix.)What is true according to the iterated elimination of strongly dominated strategies (IESDS) in the following game?   L   R T   -5,-3   -2,-5 B   -3,-4   -6,-1 None of the other alternatives is true. The unique strategy profile that survives IESDS is (T,R). The unique strategy profile that survives IESDS is (T,L). The unique strategy profile that survives IESDS is (B,R). The unique strategy profile that survives IESDS is (B,L).

Player 1 chooses a row and Player 2 chooses a column. Which is true for the following game?1 \2 L C RT 4, 4 1, 6 2, 4M 6, 0 6, 4 4, 2B 3, 4 5, 9 2, 2(A) T is strongly dominant(B) M is strongly dominated(C) (M,C) survives iterated elimination of strongly dominated strategies(D) (B,C) survives iterated elimination of strongly dominated strategies

In this and all other questions in which a game matrix is given, Player 1 chooses the row, Player 2 chooses the column, and if there is a Player 3, she chooses the matrix.) Choose all of below values of X that make strategy D a strongly dominant strategy for Player 1 in the following game. L R T 2,3 -2,-3 D 3,2 X,-2 -3 -2 0 2 3 4

Consider the following three player game.L R L RT 3,5,3 2,2,3 T 2,3,5 4,2,6M 1,4,2 4,0,0 M 1,4,3 1,2,1D 2,4,1 1,0,8 D 1,1,1 3,2,6A BIf the game is dominance solvable, find the outcome that survives the iterative elimination ofstrongly dominated actions. Write your answer as (X, Y, Z) for the actions of Player 1, 2 and 3. Ifthe game is not dominance solvable, write NO.

Consider the two player game described by the payoff matrix below.  L RU -1,5 2,1D -1,1 1,0How many outcomes survive the iterative elimination of strongly dominated strategies? Write your answer as an integer (e.g. 5). [Note that a strategy profile is an outcome, for example (D,R) is an outcome.]