Bayesian Nash Equilibrium | ベイジアンナッシュ均衡 (1)
Note that firm 2 will produce more (/less) than she would in the complete information case with high (/low) cost, since firm 1 does not take the best response to firm 2’s actual quantity but maximizes his expected profit.
Ann and Bob are in an Italian restaurant, and the owner offers them a free 3- slice pizza under the following condition. Ann and Bob must simultaneously and independently announce how many slice(s) she/he would like: Let a and b be the amount of pizza requested by Ann and Bob, respectively (you can assume that a and b are integer numbers between 1 and 3). If a + b ≤ 3, then each player gets her/his requested demands (and the owner eats any leftover slices). If a + b > 3, then both players get nothing. Assume that each players payoff is equal to the number of slices of pizza; that is, the more the better.
2 units of the firm 1’s good and A − p 2 + p 1
2 units of the firm 2’s good. Assume that the firms have identical (and constant) marginal costs c(< A), and the payoff for each firm is equal to the firm’s profit, denoted by π 1 and π 2 .
Q = K 1 =4
L 1 =8 Then, answer the following questions.
(a) In the short run, the …rm is committed to hire a …xed amount of capital K(+1), and can vary its output Q only by employing an appropriate amount of labor L . Derive the …rm’s short-run total, average, and marginal cost functions. (b) In the long run, the …rm can vary both capital and labor. Derive the …rm’s
(b) If consumer’s choice satis…es the weak axiom of revealed preferences, we can always construct a utility function which is consistent with such choice behav- iour.
(c) If a consumer problem has a solution, then it must be unique whenever the consumer’s preference relation is convex.
Substituting into p+q = 3=4, we achieve q = 1=2. Since the game is symmetric, we can derive exactly the same result for Player 1’s mixed action as well. Therefore, we get the mixed-strategy Nash equilibrium: both players choose Rock, Paper and Scissors with probabilities 1=4; 1=2; 1=4 respectively.
payoff) while M gives 1 irrespective of player 1’s strategy.
Therefore, M is eliminated by mixing L and R .
After eliminating M , we can further eliminate D (step 2) and L
(step 3), eventually picks up ( U , R ) as a unique outcome.