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

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

N/A
N/A
Protected

Academic year: 2017

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

Copied!
3
0
0

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

全文

(1)

Midterm Exam

Date: February 22, 2008

Subject: Game Theory (ECO290E) Professor: Yosuke YASUDA

1. Nash equilibrium (10 points, easy)

State the definition of Nash equilibrium (either by words or mathematically) within THREE lines.

2. True or False (15 points, moderate)

Answer whether each of the following statements is true or false. You DON’T need to explain the reason.

a) If a game has finite number of players and strategies, there always exists at least one dominant strategy for some player.

b) When there are multiple Nash equilibria, one equilibrium can be more efficient than the other.

c) If a strategy is played in some Nash equilibrium, this strategy will not be eliminated by the iterated elimination of strictly dominated strategies.

3. Nash equilibrium and dominated strategies (25 points)

Part 1

Consider the following static game.

X Y Z

A 3,3 0,5 0,4

B 0,0 3,1 1,2

a) Find the pure-strategy Nash equilibrium in this game. (5 points, easy) b) Solve this game by the iterated elimination of strictly dominated strategies. Does the resulting combination of strategies coincide with your answer in (a)? (10 points, moderate)

(2)

Part 2

Players 1 and 2 are bargaining over how to split 100 yen. Both players simultaneously name shares they would like to have, x and y. Assume x and y can take any integer numbers between 0 and 100, i.e., {0,1,2,…,100}. If x+y100, then the players receive the shares they named; if x+y101, then both receive zero.

c) What are the pure-strategy Nash equilibria of this game? How many equilibria are there exist? (10 points, challenging)

4. Mixed strategy equilibrium (25 points)

Part 1

The following payoff matrix shows the game of “Rock-Paper-Scissors.” (called

“JANKEN” in Japanese)

Rock Paper Scissors

Rock 0,0 -1,1 1,-1

Paper 1,-1 0,0 -1,1

Scissors -1,1 1,-1 0,0

This is a traditional zero-sum game whose rule can be explained as follows: Two players simultaneously chose one action from {Rock, Paper and Scissors}. Rock wins Scissors, Scissors wins Paper, and Paper wins Rock. A winner gets the payoff of 1 while a loser receives -1. If the players choose the same action, both receive 0.

a) Verify that the following mixed-strategy constitutes a Nash equilibrium: both players randomly choose each strategy with equal probability (=1/3 each). (5 points, moderate)

b) Suppose the payoffs are slightly changed in the following way, i.e., when a player wins with/loses against Rock, her payoff becomes double. Compute the mixed-strategy equilibrium in this modified game. (10 points, challenging)

(3)

Rock Paper Scissors Rock 0,0 -1,1 2,-2

Paper 1,-1 0,0 -1,1

Scissors -2,2 1,-1 0,0

Part 2

c) Find all the pure-strategy equilibria of the following game. (5 points, easy) d) Compute the mixed-strategy equilibrium. (5 points, moderate)

X Y

A 2,4 0,0

B 1,6 3,7

5. Focal point (5 points, bonus)

Choose one course in the winter term, and write down the name. (You must not choose more than one courses.) If the course you choose coincides with the most popular answer, you would get 5 points. Otherwise, you would get 0 point. You DON’T need to explain the reason why you choose the course.

Hint: It i important for you to guess which course other students are likely to choose.

s

参照

関連したドキュメント

Furuta, Log majorization via an order preserving operator inequality, Linear Algebra Appl.. Furuta, Operator functions on chaotic order involving order preserving operator

For example, if we restrict to the class of closed, irreducible 3-manifolds, then as said above, each manifold has a bounded number of incompressible surfaces, but clearly there is

In particular, Proposition 2.1 tells you the size of a maximal collection of disjoint separating curves on S , as there is always a subgroup of rank rkK = rkI generated by Dehn

A curve defined over a finite field is maximal or minimal according to whether the number of rational points attains the upper or the lower bound in Hasse- Weil’s

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

Going back to the packing property or more gener- ally to the λ-packing property, it is of interest to answer the following question: Given a graph embedding G and a positive number

It is shown that if the data R satisfy the property of encoding a finite number of positive root systems, each corresponding to an Iwasawa nilpotent algebra, then the above

We will study the spreading of a charged microdroplet using the lubrication approximation which assumes that the fluid spreads over a solid surface and that the droplet is thin so