02f_ps3

2
14.12 Game Theory Fall 2002 Problem Set 3 Due on 11/4 1. Consider the following game: 3 1 0 0 2 1 P2 l r x y 1 3 0 0 x y 1 1 L R a b a b 2 1 1 2 1 2 2 1 P3 3 3 1 0 0 2 1 P2 l r x y 1 3 0 0 x y 1 1 L R a b a b 2 1 1 2 1 2 2 1 P3 3 (a) Compute all subgame-perfect Nash equilibria. (b) Using a forward-induction argument eliminate one of these equilibria. 2. Consider an innitly repeated version of the Bertand duoploy game. Market demand is given by Q =1 P, and each rm has constant marginal cost equal to 0. Consumers buy from the rm with the lowest price, and if there are more than one rm charging the lowest price, then demand is shared by such rms equally. (a) What is the minimum δ for which the monopoly price can be supported as a subgame perfect equilibrium? (b) What is the minimum δ when there are n rms? 3. Consider the following “repeated” Stackelberg duopoly, where a long-run rm plays against many short-run rms, each of which is in the market only for one date, while the long-run rm remains in the market throughout the game. At each date t, rst, the short run rm sets its quantity x t ; then, knowing x t , the long-run rm sets its quantity y t ; and each sells his good at price p t =1 (x t + y t ). The marginal costs are all 0. The short-run rm maximizes its prot, which incurs at t. The long-run rm maximizes the present value of its prot stream where the discount rate is δ =0.99. At the beginning of each date, the actions taken previously are all common knowledge. 1

Upload: gd3000

Post on 20-Nov-2015

212 views

Category:

Documents


0 download

DESCRIPTION

teoria de juegos

TRANSCRIPT

  • 14.12 Game TheoryFall 2002Problem Set 3Due on 11/4

    1. Consider the following game:

    31

    00

    2

    1

    P2

    l r

    x y

    13

    00

    x y

    1

    1L R

    a b a b

    21

    12

    12

    21

    P3

    3

    31

    00

    2

    1

    P2

    l r

    x y

    13

    00

    x y

    1

    1L R

    a b a b

    21

    12

    12

    21

    P3

    3

    (a) Compute all subgame-perfect Nash equilibria.

    (b) Using a forward-induction argument eliminate one of these equilibria.

    2. Consider an infinitly repeated version of the Bertand duoploy game. Market demandis given by Q = 1P, and each firm has constant marginal cost equal to 0. Consumersbuy from the firm with the lowest price, and if there are more than one firm chargingthe lowest price, then demand is shared by such firms equally.

    (a) What is the minimum for which the monopoly price can be supported as asubgame perfect equilibrium?

    (b) What is the minimum when there are n firms?

    3. Consider the following repeated Stackelberg duopoly, where a long-run firm playsagainst many short-run firms, each of which is in the market only for one date, whilethe long-run firm remains in the market throughout the game. At each date t, first,the short run firm sets its quantity xt; then, knowing xt, the long-run firm sets itsquantity yt; and each sells his good at price pt = 1 (xt + yt). The marginal costs areall 0. The short-run firm maximizes its profit, which incurs at t. The long-run firmmaximizes the present value of its profit stream where the discount rate is = 0.99.At the beginning of each date, the actions taken previously are all common knowledge.

    1

  • (a) What is the subgame perfect equilibrium if there are only finitely many dates,i.e., t {0, 1, . . . , T}.

    (b) Now consider the infinitely repeated game. Find a subgame perfect equilibrium,where xt = 1/4 and yt = 1/2 at each t on the path of equilibrium play, namely inthe contingencies that happen with positive probability given the strategies.

    (c) Can you find a subgame perfect equilibrium, where xt = yt = 1/4 for each t onthe path of equilibrium play?

    4. Assuming that the discount rate is = 0.99, check whether the strategy profiles beloware subgame-perfect Nash equilibria in the infinitely repeated game where the stagegame is the following prisoners dilemma game:

    C DC 5,5 0,6D 6,0 1,1

    (a) Each player always plays C.

    (b) Each player always plays D.

    (c) Player 1 alternates between C and D, while player 2 always plays C; if any playerdeviates from this scenerio, then each plays D thereafter.

    (d) Each player plays C, and if a player deviates, then he plays C and the other playerplays D thereafter.

    (e) There are four modes, CC; P1, P2, and DD. We start in CC mode, when eachplayer plays C. If a player i plays D in CC mode while the other plays C, thenwe go to Pi mode. In Pi mode, player i plays C while the other player plays D.Once we are in Pi mode we will stay in Pi mode until player i plays C five timesin a row, at which point we go back to CC mode. If both players play D in CCmode, then we go to DD mode, and stay there forever. In DD mode, each playsD.

    2