OR4350 Introduction to Game Theory
Problem Set #1
: Wednesday, February 10, 2010 at noon in the dropbox (on 2
floor of Rhodes Hall)
: Write your Section and NetID on the first page of your homework!!!
Answers must always include complete explanations/justifications.
Binmore, Section 2.12, Number 1(a)-(e) and 6.
(a)  Since there are 3 actions for player I at node
, 2 actions at node
, and 2
actions at node
, player I has a total of 3×2×2=12 pure strategies. Since there
are 3 available actions for player II at node
and 3 actions at node
, player II
has a total of 3×3=9 pure strategies.
(b)  The 12 pure strategies of player I can be labeled:
The 9 pure strategies of player II can be labeled:
(c)  [rM]
(d)  The pure strategy pairs are
(e)  The strategic form of