Scribd
Upload
21 views

Homework 1

This document contains instructions for a homework assignment on game theory. It includes 5 questions analyzing different game theory concepts like Nash equilibria, rationalizable strategies, and iterative elimination of dominated strategies. The homework is due on September 25, 2002 and will be submitted to the teaching assistant Youngjin Hwang for the 14.12 Game Theory class taught by Professor Muhamet Yildiz in the fall 2002 semester.

Uploaded by

gd3000
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
21 views

Homework 1

This document contains instructions for a homework assignment on game theory. It includes 5 questions analyzing different game theory concepts like Nash equilibria, rationalizable strategies, and iterative elimination of dominated strategies. The homework is due on September 25, 2002 and will be submitted to the teaching assistant Youngjin Hwang for the 14.12 Game Theory class taught by Professor Muhamet Yildiz in the fall 2002 semester.

Uploaded by

gd3000
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

14.

12 Game Theory
Prof. Muhamet Yildiz
TA: Youngjin Hwang
Fall 2002

Homework 1
Due on 9/25/2002 (in class)
1. Consider an agent with Von Neumann and Morgenstren utility function u with u (x) =
(x 1)2 . Check whether the following VNM utility functions can represent this agents
preferences. (Provide the details.)
(a) u : x 7 x 1;
(b) u : x 7 (x 1)4 ;
(c) u : x 7 (x 1)2 ;
(d) u : x 7 2 (x 1)2 1.
2. Compute the set of rationalizable strategies in the following game that is played in a
class of n students where n 2: Without discussing with anyone, each student i is to
write down a real number xi [0, 100] on a paper and submit it to the TA. The TA
will then compute the average
x =

x1 + x2 + + xn
n

of these numbers. The payo of any student i is 100 |xi 2


x/3| where xi is the
number student bids. Everything described above is common knowledge.
3. Consider the game depicted in Figure 1 in extensive form (where the payo of player
1 is written on top, and the payo of 2 is on the bottom).
(a) Write this game in strategic form.
(b) What are the strategies that survive the iterative elimination of weakly-dominated
strategies in the following order: first eliminate all weakly-dominated strategies of
player 1; then, eliminate all the strategies of player 2 that are weakly dominated in
the remaining game; then, eliminate all the strategies of player 1 that are weakly
dominated in the remaining game, and so on?
(c) What are the Nash equilibria in pure strategies?
4. Consider the following game in normal form.
S1
S2
S3
S4

L
2,2
3,3
1,3
1,1

M
3,0
2,0
5,5
1,1

R
4,0
1,0
0,2
2,3

1
L

2
r

1
x

2
1

1
2

0
0

2
1

0
0

2
2

b
1
0

0
1

Figure 1:
(a) Iteratively eliminate all strictly dominated strategies; state the assumptions necessary for each elimination.
(b) What are the rationalizable strategies?
(c) What are the pure-strategy Nash equilibria?
5. We have an employer and a worker. The employer provides the capital K (in terms
of investment in technology, etc.) and the worker provides the
labor L (in terms of
the investment in the human capital) to produce f (K, L) = KL, which they share
equally. The parties determine their investment level (the employers capital K and
the workers labor L) simultaneously. The per-unit costs of capital and the labor for
the employer and the worker are r > 1/4 and c > 1/4, respectively. The worker cannot
which is positive. The payos for the employer and the worker are
invest more than L
1
f (K, L) rK
2
and

1
f (K, L) cL,
2
respectively. Everything described up to here is common knowledge. Find all the
rationalizable strategies.

You might also like