[PDF] Top 20 PQ2 最近の更新履歴 yyasuda's website

... Solve the following problems in Snyder and Nicholson (11th):. 1.[r] ... 完全なドキュメントを参照

... Solve the following problems in Snyder and Nicholson (11th):. 1.[r] ... 完全なドキュメントを参照

... (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 ... 完全なドキュメントを参照

... (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 ... 完全なドキュメントを参照

... 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 ... 完全なドキュメントを参照

... 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 ... 完全なドキュメントを参照

... 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 ... 完全なドキュメントを参照

... 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 ... 完全なドキュメントを参照

... 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 ... 完全なドキュメントを参照

... 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 ... 完全なドキュメントを参照

... 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 ... 完全なドキュメントを参照

... 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 ... 完全なドキュメントを参照

... 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 ... 完全なドキュメントを参照

... 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 ... 完全なドキュメントを参照

... 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 ... 完全なドキュメントを参照

... 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 ... 完全なドキュメントを参照

... 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 ... 完全なドキュメントを参照

... 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 ... 完全なドキュメントを参照

... 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) ... 完全なドキュメントを参照

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