📗 Enter your ID here: and click 1,2,3,4,5,6,7,8,9,10
📗 The same ID should generate the same set of questions. Your answers are not saved when you close the browser. You could print the page: , solve the problems, then enter all your answers at the end.
📗 Some of the referenced past exams can be found in on Professor Zhu's and Professor Dyer's websites: Link and Link.
📗 Please do not refresh the page: your answers will not be saved. You can save and load your answers (only fill-in-the-blank questions) using the buttons at the bottom of the page.
📗 (Fall 2017 Midterm Q12, Fall 2016 Midterm Q8, Fall 2014 Final Q13, Fall 2012 Final Q17) Which nodes are pruned by alpha-beta pruning? The max player moves first.
📗 Select the nodes:
📗 Note: please do not select any edges. This answer cannot be saved and loaded using the "download" and "load" buttons at the bottom of the page.
📗 (Fall 2017 Midterm Q12, Fall 2016 Midterm Q8, Fall 2014 Final Q13, Fall 2012 Final Q17) Which nodes are pruned by alpha-beta pruning? The min player moves first.
📗 Select the nodes:
📗 Note: please do not select any edges. This answer cannot be saved and loaded using the "download" and "load" buttons at the bottom of the page.
📗 (Fall 2017 Midterm Q3) Consider a game board consisting of bits initially at . Each player can simultaneously flip any number of bits in a move, but needs to pay the other player one dollar for each bit flipped. The player who achieves wins and collects dollars from the other player. What is the game theoretic value (in dollars) of this game for the first player?
📗 Note: "game theoretic value" is what we called "value of the game" in the lectures.
📗 (Fall 2014 Final Q4) Given the following game matrix (zero-sum game), suppose A (row) knows that B (col) will use the mixed strategy on I, II, III. What is the expected payoff for A if A plays optimally?
📗 (Fall 2014 Final Q5) Identify the pure strategy Nash equilibria in the following zero-sum game. A (row) is the max player, B (col) is the min player.
📗 (Fall 2012 Final Q18) What is the game theoretical value of the following matrix form game? A (row) is the max player, B (col) is the min player. If there are multiple Nash equilibria, use the one with the largest value (to the max player).
A \ B
I
II
III
I
II
III
📗 Note: here, I am using "game theoretical value" and the "row (max) player's value in a Nash equilibrium" interchangeably, which is slightly different from Professor Zhu's definition in Fall 2012 Final Q18. In the case there is only one Nash equilibrium, the value should be the same.
📗 (Fall 2016 Final Q7) Perform iterated elimination of strictly dominated strategies. Player A's strategies are the rows. The two numbers are (A, B)'s payoffs, respectively. Recall each player wants to maximize their own payoff. Enter the payoff pair that survives the process (i.e. payoffs from rationalizable actions). There should be only one such pair.
📗 Please enter any comments including possible mistakes and bugs with your version of the questions. If you have no comments, please enter "None": do not leave it blank.
📗 Please copy and paste the text between the *s (not including the *s) and submit it on Canvas, M12.
📗 You could save the text as text file using the button or just copy and paste it into a text file.
📗 Warning: the load button does not function properly for all questions, please recheck everything after you load. You could load your answers using the button from the text field: