Question 1 and 2 are separate question!
1. Please answer all of the followings.
Consider a game in which player 1 moves first. The set of actions available to player 1 is A1={A,B,C}.
After observing the choice of player 1, player 2 moves. The set of actions available to player 2 is A2={a,b,c,d}.
How many strategies does each of player 1 and player 2 have? At how many information sets does player 2 move?
a. Player 1 has () strategies.
b. Player 2 has () strategies.
c. Player 2 moves at () information sets.
2. In below game representation, how many strategies does each of Emily and Nina have? At how many information sets does Emily move?
a. Nina has () strategies.
b. Emily has () strategies.
c. Emily moves at () information sets.
Question 1 and 2 are separate question! 1. Please answer all of the followings. Consider a...
1. Suppose you email your professor to ask an appointment to discuss your midterm grade. The professor answers you to stop by his office at 3pm the next day. At this point, A. It is now common knowledge that you and your professor will meet tomorrow. B. It is not common knowledge that you will meet tomorrow. C. It may or may not be common knowledge depending on whether player are rational and self-interested D. It is not common knowledge...
Strategies: Imagine an extensive-form game in which player i has K infor- mation sets. a. If the player has an identical number of m possible actions in each information set, how many pure strategies does he have? b. If the player has my actions in information set k € {1, 2, ...,K}, how many pure strategies does the player have?
7. Consider the following two player game, with the players being 1 and 2. As usual 1 chooses a row and 2 a column. ABC a 1,4 2,1 3,2 4,1 b 2,3 3,4 4,3 1,2 с 3,1 4,2 1,4 2,3 d 4,2 1,3 4,3 3,2 (a) Which strategies satisfy iterated elimination of strictly dominated strategies? How many levels of knowledge of rationality do you have to assume to obtain your result? (b) If you were allowed to follow the same...
1. Consider the following game in normal form. Player 1 is the "row" player with strate- gies a, b, c, d and Player 2 is the "column" player with strategies w, x, y, 2. The game is presented in the following matrix: a b c d w 3,3 1,1 0,0 0,0 x 2,1 1,2 1,0 0,5 y 0,2 1,0 3, 2 0,2 z 2,1 1,4 1,1 3,1 (a) Find the set of rationalizable strategies. (b) Find the set of Nash...
consider the game on the right. Perform IDSDS on this game. Which strategies do you eliminate, and in which order? 1. Consider the Player 2 game on the right. Perform IDSDS orn this game. Which strategies do you eliminate a 1,20,5 2,2 4,0O b 1,35,2 5,3 2,0 c 2,3 4,0 3,3 6,2 d 3,4 2,1 4,0 7,5 Player 1 and in which order?
Consider the strategic form game above. The number of strategies player 1 has is and player 2 moves at information sets (Please write numerical values like 0,1, 74, etc.). We were unable to transcribe this imagePlayer lI D E A 2,6 0A 4A В 3,3 0,0 1,5 С 1,1 3,5 2,3 Player
Player II A 2,6 0A 4A B 3,3 0,0 15 С 1,1 3,5 2,3 Player Consider the strategic form game above. The number of strategies player 1 has is ike 0,1, 74, eta.). and player 2 moves at information sets (Please write numerical values
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
NEED HELP WITH DISCRETE MATH: . Consider the following game. Alice and Bob have a an infinite quarter chessboard in front of them. The chessboard has a left edge and a bottom edge. There is one checker on some square the chessboard. The player whose turn it is can move the checker down any positive number of squares, or can move the check one column to the left, but anywhere in that column. The game ends when a player cannot...
3. Consider the following game in normal form. Player 1 is the "row" player with strate- gies a, b, c, d and Player 2 is the "column" player with strategies w, x, y, z. The game is presented in the following matrix: W Z X y a 3,3 2,1 0,2 2,1 b 1,1 1,2 1,0 1,4 0,0 1,0 3,2 1,1 d 0,0 0,5 0,2 3,1 с Find all the Nash equilibria in the game in pure strategies.