Solve the following problems in Snyder and Nicholson (11th):. 1.[r]

1 さらに読み込む

Solve the following problems in Snyder and Nicholson (11th):. 1.[r]

1 さらに読み込む

(d) Zermelo’**s** theorem assures that the first mover has a winning strategy in ANY perfect information game with strictly opposite interests.
(e) The weak perfect Bayesian equilibrium puts NO restriction on beliefs at the information sets that are not reached in equilibrium.

2 さらに読み込む

(d) What is the Nash equilibrium of this game? 4. Mixed Strategy (15 points)
Three …rms (1, **2** and 3) put three items on the market and can advertise these products either on morning (= M ) or evening TV (= E). A …rm advertises exactly once per day. If more than one …rm advertises at the same time, their pro…ts become 0. If exactly one …rm advertises in the morning, its pro…t is 1; if exactly one …rm advertises in the evening, its pro…t is **2**. Firms must make their daily advertising decisions simultaneously.

2 さらに読み込む

5. Bayesian Game (20 points)
There are 10 envelopes and each of them contains a number 1 through 10. That is, one envelope contains 1, another envelope contains **2**, and so on; these numbers cannot be observable from outside. Suppose there are two individuals. Each of them randomly receives one envelope and observes the number inside of her/his own envelope. Then, they are given an option to exchange the envelope to the other person; exchange occurs if and only if both individuals wish to exchange. Finally, individuals receive prize ($) equal to the number, i.e., she receives $X if the number is X. Assume that both individuals are risk-neutral so that they maximize expected value of prizes.

さらに見せる
3 さらに読み込む

Hint: Your answers in (a) – (c) may change depending on the value of θ.
4. Duopoly (20 points)
Consider a duopoly game in which two firms, denoted by firm 1 and firm **2**, simul- taneously and independently select their own price, p 1 and p **2** . The firms’ products are differentiated. After the prices are set, consumers demand 24 − p i +

3 さらに読み込む

Consider the following two-person dynamic game. In the …rst period, game A is played; after observing each player’**s** actions, they play game B in the second period. Assume that the payo¤**s** are simply the sum of the payo¤**s** of two games (i.e., there is no discounting).

2 さらに読み込む

4. Auctions (30 points)
Suppose that the government auctions one block of radio spectrum to two risk neu- tral mobile phone companies, i = 1, **2**. The companies submit bids simultaneously, and the company with higher bid receives a spectrum block. The loser pays nothing while the winner pays a weighted average of the two bids:

2 さらに読み込む

Three firms (1, **2** and 3) put three items on the market and can advertise these products either on morning (= M ) or evening TV (= E). A firm advertises exactly once per day. If more than one firm advertises at the same time, their profits become 0. If exactly one firm advertises in the morning, its profit is 1; if exactly one firm advertises in the evening, its profit is **2**. Firms must make their daily advertising decisions simultaneously.

2 さらに読み込む

Prisoners’ Dilemma: Analysis
( Silent , Silent ) looks mutually beneficial outcomes, though
Playing Confess is optimal regardless of other player’**s** choice! Acting optimally ( Confess , Confess ) rends up realizing!!

27 さらに読み込む

1 It may stay out (O),
**2** prepare itself for combat and enter (“Ready” = R),
3 or enter without making preparations (“Unready” = U ).
Preparation is costly but reduces the loss from a fight. The incumbent may either fight (F ) or accommodate (A) entry. Depending on the payoffs, we consider two cases.

12 さらに読み込む

A belief about other players’ types is a conditional probability distribution of other players’ types given the player’**s**
knowledge of her own type p i (t −i |t i ).
When nature reveals t i to player i, she can compute the belief p i (t −i |t i ) using Bayes’ rule:

13 さらに読み込む

First-Price: General Model (1)
Consider a first-price auction with n bidders in which all the conditions in the previous theorem are satisfied.
Assume that bidders play a symmetric equilibrium, β(x). Given some bidding strategy b, a bidder’**s** expected payoff becomes

15 さらに読み込む

Proof Sketch (**2**): Existence of Pivotal Voter Lemma 3 (Existence of Pivotal Voter)
There is a voter n ∗ = n(b) who is extremely pivotal in the sense that by changing his vote at some profile he can move b from the very bottom of the social ranking to the very top.

13 さらに読み込む

Axiomatic Approach (**2**)
PAR (Pareto Efficiency) Suppose hU, di is a bargaining problem with v, v ′ ∈ U and v ′
i > v i for i = 1, **2**. Then f (U, d) 6= v. The axioms SYM and PAR restrict the behavior of the solution on single bargaining problems, while INV and IIA require the solution to exhibit some consistency across bargaining problems.

11 さらに読み込む

Explain.
(b) Show that any risk averse decision maker whose preference satisfies indepen- dence axiom must prefer L **2** to L 3 .
3. Question 3 (4 points) Suppose a monopolist with constant marginal costs prac- tices third-degree price discrimination. Group A’**s** elasticity of demand is ǫ A and

2 さらに読み込む

b + (1 )b 0
where b is the winner’**s** bid, b 0 is the loser’**s** bid, and is some constant
satisfying 0 1. (In case of ties, each company wins with equal probability.) Assume the valuation of the spectrum block for each company is independently and uniformly distributed between 0 and 1.

2 さらに読み込む

Problem Set **2**: Due on May 14
Advanced Microeconomics I (Spring, 1st, 2013)
1. Question 1 (6 points)
(a) Suppose the utility function is continuous and strictly increasing. Then, show that the associated indirect utility function v(p, ω) is quasi-convex in (p, ω). (b) Show that the (minimum) expenditure function e(p, u) is concave in p.

2 さらに読み込む

Problem Set **2**: Due on May 10
Advanced Microeconomics I (Spring, 1st, 2012) 1. Question 1 (**2** points)
Suppose the production function f satisfies (i) f (0) = 0, (ii) increasing, (iii) con- tinuous, (iv) quasi-concave, and (v) constant returns to scale. Then, show that f must be a concave function of x.

2 さらに読み込む

すべて**の**プレーヤーに支配戦略が無いゲームでも解け る場合がある
「支配される戦略**の**逐次消去」（後述）
（お互い**の**行動に関する）「正しい予想**の**共有＋合理性」 によってナッシュ均衡は実現する！

20 さらに読み込む