• 検索結果がありません。

Midterm12 最近の更新履歴 yyasuda's website

N/A
N/A
Protected

Academic year: 2017

シェア "Midterm12 最近の更新履歴 yyasuda's website"

Copied!
2
0
0

読み込み中.... (全文を見る)

全文

(1)

1

Midterm Exam

Date: February 29, 2012

Subject: Game Theory (ECO290E) Instructor: Yosuke YASUDA

1. Focal Point (4 points, think strategically!)

Select a subway station in Tokyo, and write down its name. You should NOT write more than one name. If you will successfully choose the most popular answer, you would get 4 points. Otherwise, you will receive 0. You do NOT need to explain any reason why you choose your answer.

2. Static games (18 points, easy)

Consider the following two player static games expressed by (1), (2). For each game, answer the following questions:

a) Find a dominated strategy (if any).

b) Find all pure strategy Nash equilibria (if any).

c) Explain whether the game can be solved by iterated elimination of strictly dominated strategies.

(1)

P1 ╲ P2 L R

U 4, 4 0, 3

D 3, 0 2, 2

(2)

P1 ╲ P2 A B

X 1, 2 3, 1

Y 2, 1 0, 0

Z 0, 0 2, 2

3. Mixed Strategy (16 points, difficult)

Consider a two player static game expressed by the following payoff matrix.

(2)

2

P1 ╲ P2 D E F

A 7, 6 5, 8 0, 0

B 5, 8 7, 6 0, 0

C 0, 0 0, 0 4, 4

a) Find all pure strategy Nash equilibria.

b) Find the mixed strategy Nash equilibrium in which each player randomizes over just the first two actions, i.e., A, B for P1 and D, E for P2, respectively.

c) Is there a mixed strategy Nash equilibrium in which both players randomize over all three strategies? If yes, derive the equilibrium. If not, explain why.

4. Dynamic Game (12 points, moderate)

Consider a dynamic game depicted by Figure 1.

a) Express this game into normal-form (strategic-form) by drawing the payoff matrix. b) Find all Nash equilibria.

c) Solve the game by backward induction. You do not need to worry about the way to write the answer. As long as the path which survives in backward induction process is apparent, you will receive the full score.

1

2

2

A

B

C

D

E

F

(1, 1)

(4, 2)

(3, 1)

(2, 5)

Figure 1

参照

関連したドキュメント

2 Combining the lemma 5.4 with the main theorem of [SW1], we immediately obtain the following corollary.. Corollary 5.5 Let l > 3 be

Kraaikamp [7] (see also [9]), was introduced to improve some dio- phantine approximation properties of the regular one-dimensional contin- ued fraction algorithm in the following

In Section 3 the extended Rapcs´ ak system with curvature condition is considered in the n-dimensional generic case, when the eigenvalues of the Jacobi curvature tensor Φ are

On the other hand, from physical arguments, it is expected that asymptotically in time the concentration approach certain values of the minimizers of the function f appearing in

In this work, we present an asymptotic analysis of a coupled sys- tem of two advection-diffusion-reaction equations with Danckwerts boundary conditions, which models the

In Appendix B, each refined inertia possible for a pattern of order 8 (excluding reversals) is expressed as a sum of two refined inertias, where the first is allowed by A and the

In this paper, based on the concept of rough variable proposed by Liu 14, we discuss a simplest game, namely, the game in which the number of players is two and rough payoffs which

In this paper we show how to obtain a result closely analogous to the McAlister theorem for a certain class of inverse semigroups with zero, based on the idea of a Brandt