University of Kansas, Fall 2007
Philosophy 666: Rational Choice Theory
Ben Eggleston—eggleston@ku.edu
test on game theory
(October 24, 2007)
Instructions:
 Answer all of the following questions on the answer sheets provided. You can write on this
list of
questions, but credit will be awarded only for answers written on answer
sheets.
 Do not access any book, notebook, newspaper, calculator, computer, cell
phone, or other possible source of inappropriate aid during the test, do not
leave the room before you are finished taking the test, and be sure to finish
the test within this 50minute testing period—no credit will be given for any
work done after you access any possible source of inappropriate aid, after you
leave the room for any reason, or after the end of the testing period.
 When you are finished, be sure your name is written on each of your answer
sheets, and turn them in. You do not need to turn in this list of questions.
Questions:
The matrices in questions 1–7 involve zerosum games, with each cell containing a number that
represents the row player’s utility and the negation of the column player’s
utility.
 Analyze the following game using dominance considerations and write the strategy pair(s) corresponding to its solution(s). When writing the strategy pair(s),
write each of them in the form (R_{x}, C_{y}),
where x = 1, 2, or 3 and y = 1, 2, 3, or 4.

C_{1} 
C_{2} 
C_{3} 
C_{4} 
R_{1} 
2 
4 
7 
3 
R_{2} 
7 
8 
6 
5 
R_{3} 
2 
9 
1 
4 
 Write the equilibrium strategy pair(s) for the following game. Again, for each pair
you write, use the form (R_{x}, C_{y}),
where x = 1, 2, or 3 and y = 1, 2, 3, or 4.

C_{1} 
C_{2} 
C_{3} 
C_{4} 
R_{1} 
5 
4 
4 
4 
R_{2} 
7 
3 
6 
2 
R_{3} 
2 
2 
1 
4 
 Suppose that the expected utility of the following game for
the column player is a formula involving q (where q is her
probability of playing C_{1} as opposed to C_{2}) in which the
coefficient of q ends up being 0, because of the strategy (p R_{1},
(1 – p) R_{2}) that the row player happens to be playing.
Derive the value of p that makes this the case, by starting with (1) a
formula expressing the expected utility of the game for the row player,
(2) a formula expressing the expected utility of the game for the column player, or (3)
a formula expressing the value
of the game, and simplifying whatever formula you start with until you can isolate an expression
involving p that you can then use to solve for p. (Show your
work, of course.)

C_{1} 
C_{2} 
R_{1} 
3 
9 
R_{2} 
8 
5 
 What values of p and q make [(p R_{1}, (1 –
p) R_{2}), (q C_{1}, (1 – q) C_{2})]
an equilibrium strategy pair for the following game? (You do not have to show your
work. An answer of the form ‘p = __, q = __’ can earn full
credit.)

C_{1} 
C_{2} 
R_{1} 
8 
4 
R_{2} 
1 
7 
 Suppose that the row player believes that the column player is going to
play the following game with the strategy (½ C_{1}, ½ C_{2}).
What is the row player’s best response?

C_{1} 
C_{2} 
R_{1} 
4 
8 
R_{2} 
6 
2 
 Suppose that, in a twoperson zerosum game with row strategies R_{1}
and R_{2} and column strategies C_{1} and C_{2} (as in
the games in the previous several questions), the row player is playing
strategy (½ R_{1}, ½ R_{2}), and the column player computes
(correctly) that if she, too, plays a mixed strategy giving equal weight to
each of her two pure strategies (i.e., plays strategy (½ C_{1}, ½ C_{2})),
then she gets as high an expected utility as she can against the row player's
strategy (½ R_{1}, ½ R_{2}). Does this mean that [(½ R_{1},
½ R_{2}), (½ C_{1}, ½ C_{2})] is an equilibrium
strategy pair for the game under consideration? Why or why not?
 Suppose that, for the following game, the strategy pair [(¼ R_{1},
¾ R_{2}), (⅓ C_{1},
⅔ C_{2})] is an equilibrium pair. What is the value of the game?

C_{1} 
C_{2} 
R_{1} 
a 
5 
R_{2} 
6 
a 
 Write the purestrategy equilibrium pair(s) for the following game (or, if
there aren’t any, write ‘no purestrategy equilibrium pairs’). For each strategy pair
you write, use the form (R_{x}, C_{y}),
where x = 1 or 2 and y = 1 or 2. Is the game a coordination
game (also known as a battle of wills), a prisoner’s dilemma, or neither?

C_{1} 
C_{2} 
R_{1} 
1, 7 
7, 5 
R_{2} 
2, 8 
5, 6 
 Follow the instructions for the previous question, but for the following
game:

C_{1} 
C_{2} 
R_{1} 
5, 9 
2, 2 
R_{2} 
4, 5 
8, 8 
 Write a matrix like the following and fill it in with eight numbers (two
in each cell) so that it represents a prisoner’s dilemma. Then (1) name the
two important solution concepts that do not coincide in a prisoner’s dilemma,
(2) state the definition, criteria, or identifying characteristics of each of those two
solution concepts, and (3) indicate, for each of those two solution concepts,
which strategy pair(s) in your matrix is (or are) associated with that
solution concept. As above, for each strategy pair
you write, use the form (R_{x}, C_{y}),
where x = 1 or 2 and y is 1 or 2.

C_{1} 
C_{2} 
R_{1} 
, 
, 
R_{2} 
, 
, 
Instructions, revisited:
As stated in item 3 of the instructions, you do not need to turn in this
list of questions.