Microeconomics II Lecture 4: Incomplete Information Karl Wärneryd Stockholm School of Economics November 2016

Similar documents
EconS Microeconomic Theory II Midterm Exam #2 - Answer Key

Game Theory. Monika Köppl-Turyna. Winter 2017/2018. Institute for Analytical Economics Vienna University of Economics and Business

Bayesian Games and Mechanism Design Definition of Bayes Equilibrium

Theory of Auctions. Carlos Hurtado. Jun 23th, Department of Economics University of Illinois at Urbana-Champaign

Multi-Player Contests with Asymmetric Information Karl Wärneryd

Lecture 6 Games with Incomplete Information. November 14, 2008

Lecture Note II-3 Static Games of Incomplete Information. Games of incomplete information. Cournot Competition under Asymmetric Information (cont )

University of Warwick, Department of Economics Spring Final Exam. Answer TWO questions. All questions carry equal weight. Time allowed 2 hours.

Introduction to Game Theory

EconS Advanced Microeconomics II Handout on Mechanism Design

Game theory lecture 4. September 24, 2012

Ph.D. Preliminary Examination MICROECONOMIC THEORY Applied Economics Graduate Program May 2012

Solution: Since the prices are decreasing, we consider all the nested options {1,..., i}. Given such a set, the expected revenue is.

Lecture 4. 1 Examples of Mechanism Design Problems

Advanced Microeconomics

NTU IO (I) : Auction Theory and Mechanism Design II Groves Mechanism and AGV Mechansim. u i (x, t i, θ i ) = V i (x, θ i ) + t i,

Some Notes on Adverse Selection

Notes on Mechanism Designy

Lecture Slides - Part 4

Advanced Microeconomics II

Mechanism Design II. Terence Johnson. University of Notre Dame. Terence Johnson (ND) Mechanism Design II 1 / 30

Multi-object auctions (and matching with money)

Mechanism Design: Dominant Strategies

Lecture 10: Mechanism Design

Algorithmic Game Theory and Applications

Introduction to Game Theory

Vickrey-Clarke-Groves Mechanisms

Mechanism Design: Basic Concepts

EconS Microeconomic Theory II Homework #9 - Answer key

Informed Principal in Private-Value Environments

Department of Agricultural Economics. PhD Qualifier Examination. May 2009

Vickrey Auction. Mechanism Design. Algorithmic Game Theory. Alexander Skopalik Algorithmic Game Theory 2013 Mechanism Design

UC Berkeley Haas School of Business Game Theory (EMBA 296 & EWMBA 211) Summer 2016

Information Acquisition in Interdependent Value Auctions

Advanced Economic Theory Lecture 9. Bilateral Asymmetric Information. Double Auction (Chatterjee and Samuelson, 1983).

Some Lecture Notes on Auctions

Economics 3012 Strategic Behavior Andy McLennan October 20, 2006

Module 18: VCG Mechanism

Teoria das organizações e contratos

EconS 501 Final Exam - December 10th, 2018

The Revenue Equivalence Theorem 1

DEPARTMENT OF ECONOMICS YALE UNIVERSITY P.O. Box New Haven, CT

Advanced Microeconomics

9 A Class of Dynamic Games of Incomplete Information:

Outline for Static Games of Incomplete Information

On revealed preferences in oligopoly games

Some Lecture Notes on Auctions

Robert Wilson (1977), A Bidding Model of Perfect Competition, Review of Economic

Mechanism Design: Bargaining

Katz and Shapiro (1985)

Mechanism Design: Bayesian Incentive Compatibility

Lecture Notes on Game Theory

D i (w; p) := H i (w; S(w; p)): (1)

CPS 173 Mechanism design. Vincent Conitzer

Microeconomic Theory (501b) Problem Set 10. Auctions and Moral Hazard Suggested Solution: Tibor Heumann

EC476 Contracts and Organizations, Part III: Lecture 2

Motivation. Game Theory 24. Mechanism Design. Setting. Preference relations contain no information about by how much one candidate is preferred.

Chapter 2. Equilibrium. 2.1 Complete Information Games

Mechanism Design: Review of Basic Concepts

Auctions. data better than the typical data set in industrial organization. auction game is relatively simple, well-specified rules.

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012

Algorithmic Game Theory Introduction to Mechanism Design

1 Games in Normal Form (Strategic Form)

Perfect Bayesian Equilibrium. Definition. The single-crossing property. This is a draft; me with comments, typos, clarifications, etc.

Optimal Mechanism Design with Aftermarket Competitions

DISCUSSION PAPER SERIES

Lecture Notes in Information Economics

Mechanism Design. Christoph Schottmüller / 27

Upstream capacity constraint and the preservation of monopoly power in private bilateral contracting

Vickrey Auction VCG Characterization. Mechanism Design. Algorithmic Game Theory. Alexander Skopalik Algorithmic Game Theory 2013 Mechanism Design

Robust Predictions in Games with Incomplete Information

Answer Key for M. A. Economics Entrance Examination 2017 (Main version)

Symmetric Separating Equilibria in English Auctions 1

Monopoly with Resale. Supplementary Material

Robust Mechanism Design and Robust Implementation

Deceptive Advertising with Rational Buyers

Advanced Microeconomic Analysis, Lecture 6

Optimal Mechanism Design with Aftermarket Interactions

Final Exam (Solution) Economics 501b Microeconomic Theory

Introduction: Asymmetric Information and the Coase Theorem

MS&E 246: Lecture 12 Static games of incomplete information. Ramesh Johari

Game Theory. Strategic Form Games with Incomplete Information. Levent Koçkesen. Koç University. Levent Koçkesen (Koç University) Bayesian Games 1 / 15

Bayesian Nash equilibrium

Entry in First-price Auctions with Signaling

Sequential Bidding in the Bailey-Cavallo Mechanism

Overview. Producer Theory. Consumer Theory. Exchange

Static Information Design

Answers to Spring 2014 Microeconomics Prelim

Inducing Efficiency in Oligopolistic Markets with. Increasing Returns to Scale

Mechanism Design. Terence Johnson. December 7, University of Notre Dame. Terence Johnson (ND) Mechanism Design December 7, / 44

An Introduction to the Theory of Mechanism Design

Common-Value All-Pay Auctions with Asymmetric Information

RECIPROCAL RELATIONSHIPS AND MECHANISM DESIGN

Lecture 6: Communication Complexity of Auctions

Information Advantage in Tullock Contests

ANSWER KEY 2 GAME THEORY, ECON 395

Working Paper EQUILIBRIUM SELECTION IN COMMON-VALUE SECOND-PRICE AUCTIONS. Heng Liu

Game Theory Fall 2003

Hybrid All-Pay and Winner-Pay Contests

Endogenous Games and Mechanisms: Side Payments Among Players

Transcription:

Microeconomics II Lecture 4: Incomplete Information Karl Wärneryd Stockholm School of Economics November 2016 1

Modelling incomplete information So far, we have studied games in which information was complete, although it may have been imperfect (in the sense that not every move in the game is observed by every player) In a game of incomplete information, some aspects of the structure of the game itself are not common knowledge among the players It could be the case that a player does not know which strategies are available to another player, or what his payo s are Early on, such games were thought not to be analyzable Harsanyi (1967 68) argued that, under certain conditions, all forms of uncertainty about the game could be reduced to uncertainty about other players payo s Hence the standard approach to games of incomplete information is now to consider the associated games of complete but imperfect information which start with a move by Nature, who determines the players types, ie, their payo functions We first illustrate this with some examples 2

Voluntary public goods provision Palfrey and Rosenthal (1989) discuss voluntary contributions to public goods under incomplete information We consider a simple example with only two players Each player can either contribute or not contribute If at least one player contributes, the public good is provided, and both players enjoy a utility of 1 from this If player i contributes, he also sustains a cost 1 >c i > 0 If nobody contributes, each gets utility zero Given the costs of the two players the situation is therefore as in the matrix below Player 2 Contribute Don t Player 1 Contribute 1 c 1, 1 c 2 1 c 1, 1 Don t 1, 1 c 2 0, 0 First note that, regardless of what the costs are, there are always two asymmetric pure-strategy equilibria in which one player contributes and the other does not 3

Next assume that a player s cost is private information, but each player has the same continuous prior probability distribution F for the cost of the other player Then player i rationally contributes with probability 1 if we have that or, equivalently, 1 c i > Prob(Player j contributes), c i < 1 Prob(Player j contributes) =: c? Since the situation for player j is symmetric, we must have that c? =1 F (c? ) in equilibrium Hence, for example, if F is the uniform distribution on [0, 1], we have c? = 5 4

Cournot duopoly with incomplete information Consider the same Cournot duopoly as before, but now assume Firm 1 s cost is commonly known to be c 1, but Firm 2 s cost is private information and commonly known to be c L 2 with probability and c H 2 with probability 1, with c L 2 <c H 2 Let q L 2 and q H 2 be the quantities supplied by Firm 2 when it has low and high cost, respectively Then Firm 1 s expected profit is E 1 = (a q 1 q L 2 c 1 )q 1 + (1 )(a q 1 q H 2 c 1 ) Hence Firm 1 s first order condition for a best reply is q 1 = a c 1 ( q2 L + (1 )q2 H ) 2 A Firm 2 with low cost has expected profit L 2 =(a q 1 q L 2 c L 2 )q L 2 and therefore first order condition q L 2 = a cl 2 q 1 2 Similarly, a high cost type Firm 2 has first order condition q H 2 = a ch 2 q 1 2 5

We assume, for simplicity, that an interior equilibrium exists, ie, one where Firm 1 and both types of Firm 2 produce positive output Solving these three equations simultaneously for an equilibrium, we get q L? 2 = a 2cL 2 + c 1 3 1 6 (ch 2 c L 2 ), and q H? 2 = a 2cH 2 + c 1 3 + 6 (ch 2 c L 2 ), q? 1 = a 2c 1 + c L 2 + (1 )c H 2 3 From an economic point of view, note that for 0 < <1, the low-type Firm 2 produces less than it would if = 1 and the high-type Firm 2 produces more than it would if = 0 6

Formalities Assume a player s type i is drawn from a common prior distribution, with p( 1,, n ) the probability of a particular type vector over the players Each player knows only his own type for sure Let p( i i ) be a player s conditional probability on the others types given his own Each player has a pure strategy set S i as before, but his utility function u i (s 1,,s n, 1,, n ) may now also depend on the types of the players Since a player now observes his type, he may make his strategy choice contingent on type Let s i ( i )be the pure strategy choice of player i when he observes himself to be of type i If the set of types if finite, a (Bayesian) equilibrium in pure strategies of such a game is simply a collection of strategies, one for each type of each player, such that each type of each player plays a best reply given the strategies of the others, or, formally, that X s i ( i ) 2 arg max p( i i )u i (s 0 i,s i ( i ), i, i ) s 0 i 2S i i for all i and i 7

Purification of mixed equilibria Harsanyi also showed that mixed-strategy equilibria can be interpreted as pure-strategy equilibria of games with some incomplete information about payo s, which might be more appealing to people who reject the idea of players actually randomizing their decisions Consider the following game, which has some similarities to the market-entry with fixed costs game we studied some time ago Player 2 Enter Don t Player 1 Enter 1, 1 1, 0 Don t 0, 1 0, 0 The unique symmetric equilibrium of this game has each player entering with probability 1/2 8

Now instead consider another game, which is exactly like the earlier one except there is some small uncertainty about a player s payo if he is the only one entering Specifically, if a player is the only one entering, he now gets 1 + i, where i is drawn from the uniform distribution on [ ", "] for ">0 Player 2 Enter Don t Player 1 Enter 1, 1 1+ 1, 0 Don t 0, 1+ 2 0, 0 This game has an equilibrium in which each player plays the pure strategy n Don t if i < 0 s i ( i )= Enter otherwise To see this, note that if Player 2 plays this strategy, he will enter with probability 1/2 Hence Player 1 s expected payo from entering is 5( 1) + 5(1 + 1 ) which is non-negative if 1 0 Hence it is a best reply for Player 1 to play the same strategy against Player 2 As "! 0, the game converges to the original, complete information game, and the pure-strategy equilibrium of the incomplete information game converges to the mixed-strategy equilibrium of the original game Harsanyi showed more generally that mixed equilibria of generic finite normal-form games can be obtained as the limits of sequences of pure-strategy equilibria of games with payo uncertainty 9

Contests (Wärneryd 2003) In a contest, players make expenditures in order to increase their probability of winning a fixed prize Hence any positive expenditure is wasted from an e ciency perspective Contests have proved useful in modelling, eg, rent seeking (going back to Tullock (1980)) and armed warfare (Hirshleifer (1995), Skaperdas (1992)) We shall consider the implications of informational asymmetry in a common value contest The assumption of common values and asymmetric information seems relevant for many applications; one example would be firms lobbying for monopoly privileges in a product market, where one firm is already the incumbent Another might be a court battle between an investor and an entrepreneur who has defaulted on a debt contract, where only the entrepreneur knows the value of the surplus generated by the project 10

Symmetric information Two risk neutral agents, 1 and 2, compete for a prize of value y, where y is distributed according to the cumulative distribution F with support [y, 1] Let ỹ be the expected value of the prize If agent 1 expends x 1 and agent 2 expends x 2,we assume the probability of agent i winning the prize is p i (x 1,x 2 ):= xi /(x 1 + x 2 ) if x 1 + x 2 > 0 1/2 otherwise The expected utility of agent i if neither agent is informed of the value y when making his expenditure decision is then u U i (x 1,x 2 ):= Z 1 y p i (x 1,x 2 )ydf (y) x i The best reply of agent i given the expenditure of the other agent is given by the first-order condition @u U i (x 1,x 2 ) @x i = x j ỹ 1 = 0 for j 6= i (x 1 + x 2 ) 2 In equilibrium, each agent expends x S := ỹ/4 Similarly, it is easily seen that if both agents are informed about y when making their expenditures, then for any y they will each expend x i := y/4 Hence the ex ante expected individual expenditure is again ỹ/4 11

Asymmetric information Consider next what happens if one agent is informed of y but the other agent is uninformed The uninformed agent is now potentially subject to an analogue of the winner s curse, and hence cannot rationally estimate the value of the prize at its expectation The informed agent s objective function, given the realization y, is now u I (y) := x I (y) x U + x I (y) y x I(y), where x U is the expenditure of the uninformed agent and x I (y) is the expenditure of the informed agent as a function of the value y We shall sometimes refer to y as the type of the informed player The first partial derivative of this objective function with respect to x I (y) is @u I (y) @x I (y) = x U (x U + x I (y)) 2 y 1, which is negative for all x I (y) 0 if we have x U >y The informed agent s best reply function, given y, is therefore x I (y) = n p xu y x U if x U apple y 0 otherwise 12

Consider next the uninformed agent, whose objective function is now u U := Z 1 y x U x U + x I (y) ydf (y) x U It cannot be the case in equilibrium that x I (y) = 0 for all y This would imply x U ȳ But given that no type of the informed player expends a positive amount, this cannot be a best reply on the part of the uninformed player, since he could lower his expenditure and still win with probability one in all states The relevant condition for an optimal expenditure level on the part of the uninformed agent, given x I (y), is therefore Z @u 1 U = @x U y x I (y) ydf (y) 1=0 (x U + x I (y)) 2 13

To simplify, suppose there are just two possible values of the prize, y H and y L, where we have 0 <y L <y H Let the probability of y H be q There are two possible types of equilibria Case 1: Both informed types are active Suppose we have x I (y L ) > 0 and x I (y H ) > 0 The uninformed agent s first order condition for a best reply expenditure is then x I (y L ) (1 q) (x U + x I (y L )) 2 y x I (y H ) L + q (x U + x I (y H )) 2 y H 1= 1 p 1 p (1 q) p yl + q p yh 2=0, xu xu so equilibrium expenditure is x U = (qp y H + (1 q) p y L ) 2 4 We must have x U that < y L for this to be an equilibrium, ie, p yl /y H q< p =: ˆq 1 yl /y H 14

Case 2: Only the highest informed type is active Suppose we have x I (y L ) = 0 The uninformed agent s firstorder condition then reduces to x I (y H ) q (x U + x I (y H )) 2 y 1 p H 1=qp yh 1 q =0, xu so we have that 2 q x U = y H 1+q In order for this to be consistent with the lowest type expending nothing, we must have x U y L, ie, that The figure illustrates both types of equilibrium q ˆq q 1 0 Case 2 Case 1 ˆq 0 1/2 1 p yl /y H 15

Note that in the Case 2 equilibrium, the uninformed player s probability of winning the object is x U 1 q + q x U + x I (y H ) =1 q + q2 1+q > 1/2 Let q! 0 and y L /y H! 0, so that the condition for the existence of equilibrium is satisfied Then the probability of the uninformed player winning approaches 1 It can be shown more generally that the uninformed player always wins with a strictly higher probability than does the informed player 16

Optimal auctions Here is a little bit of mechanism design, or contract, theory There is a seller with one unit of a good, and two potential buyers The buyers have valuations of the good that are independent draws from the same distribution A buyer s valuation is with probability p and with probability p =1 p, with < The seller wants to maximize his expected revenue by auctioning o the good in an optimal fashion We therefore depart slightly from the noncooperative framework by assuming that the buyers can ex ante commit to follow the rules of the auction proposed by the seller, ie, they can sign a binding contract to be governed by the mechanism o ered by the seller Once they have accepted the mechanism, they are in a game designed by the seller We are thus looking for the optimal game form from the point of view of the seller A familar mechanism would be the first-price auction, in which the players simultaneously make bids and the highest bidder gets the object and pays his bid But more generally the seller could construct a game in which the players have more extensive strategy sets, eg, they could make bids, but also wiggle their ears, etc In such a setting, familiar auction types are not necessarily optimal 17

Suppose the buyers have some pure strategy sets S 1 and S 2 under a mechanism The mechanism then also specifies the probability x i (s 1,s 2 ) that buyer i gets the good, and the transfer payment T i (s 1,s 2 ) from the buyer to the seller Since participation in the mechanism is voluntary, each type of each buyer must have non-negative expectation in? equilibrium Suppose 1 and 2? are equilibrium strategies under the mechanism For each type 1 2{, } and each? s 1 2 S 1 that has positive probability under 1, we must have that E 2 E? 2 ( 2 )( 1 x 1 (s 1,s 2 ) T 1 (s 1,s 2 )) 0 for it to be rational for buyer 1 to accept the mechanism This is buyer 1 s individual rationality constraint A similar one must hold for buyer 2? Since 1 and 2? are equilibrium strategies, we must also? for every 1, s 1 in the support of 1, and s 0 1 have that E 2 E? 2 ( 2 )( 1 x 1 (s 1,s 2 ) T 1 (s 1,s 2 )) E 2 E? 2 ( 2 )( 1 x 1 (s 0 1,s 2 ) T 1 (s 0 1,s 2 )) This is buyer 1 s incentive compatibility constraint A similar one holds for buyer 2 18

We now note that given the game and the equilibrium strategies, what happens in the end is a function only of the buyers types That is, the seller could instead of having the buyers actually play the game just ask them to report their types and promise to implement the outcome that would have happened in equilibrium of the more complicated game That is, if we define x i (ˆ 1, ˆ 2 ):=E (? 1 (ˆ 1 ),? 2 (ˆ 2 )) x i(s 1,s 2 ) and T i (ˆ 1, ˆ 2 ):=E (? 1 (ˆ 1 ),? 2 (ˆ 2 )) T i(s 1,s 2 ) Since the strategies they would have played are equilibrium strategies, and they have positive expectation, they would accept a simplified mechanism defined by x and T where they only report their types, and they would in fact truthfully report their types This is an instance of the more general revelation principle, which says that any mechanism has an equivalent direct-revelation mechanism, ie, one in which the agents only report their types This is convenient, since we can then study only direct-revelation mechanisms and still find the overall optimal one 19

Let X, X, T, and T be the expectations of the probability of getting the good and the transfer for buyers of low and high type The individual rationality and incentive compatibility constraints are then X T 0, (IR 1 ) X T 0, (IR 2 ) X T X T, (IC 1 ) and X T X T (IC 2 ) We now want to find X and T such that the seller s expected profit Eu 0 := pt + pt is maximized subject to the IR and IC constraints 20

It can be shown that the only binding constraints at the optimum are IR 1 and IC 2 Hence the transfer payments are determined as T = X and T = (X X)+ X Substituting these values into the seller s profit gives Eu 0 =( p )X + p X Suppose we have apple p Then Eu 0 is decreasing in X Hence the optimal solution is to set X = 0 and X as large as possible By symmetry, if both buyers are of high type they must each win with probability 1/2 Hence we must have X = p + p(1/2) The optimal mechanism is therefore to sell to nobody if both report low types, to sell only to the high type if only one reports the high type, and to sell to each with probability one-half if both report the high type 21

Suppose instead we have > p Then Eu 0 is strictly increasing in both X and X But by symmetry, a player s ex ante probability of winning must not exceed 1/2; hence we must have px + px =1/2 ( ) Solving for X and substituting in Eu 0 gives Eu 0 = 1 2p ( p )+p ( )X p Hence we again have X = p + p(1/2) From ( ) we have X = p/2 Thus in this case the optimal mechanism awards the good to a high type if he is the only one; in all other cases the mechanism awards the good with equal probability to each player 22

Problem Consider the following two payo matrices Player 2 L R Player 1 T 1, 1 0, 0 B 0, 0 0, 0 I Player 2 L R Player 1 T 0, 0 0, 0 B 0, 0 2, 2 II Now consider a game in which Nature first determines whether the payo s are as in I or as in II, with both being equally likely Player 1 then observes which is the case, but Player 2 does not The players next choose actions simultaneously, and get payo s according to the relevant matrix Find all the pure-strategy equilibria of this game 23

Problem Consider again the voluntary public goods provision game with incomplete information that we have discussed, but now let there be n>2 players, and assume the public good is provided only if m players contribute Find an equilibrium condition Show that for m 2, there is always an equilibrium in which nobody contributes Problem Consider again the Cournot duopoly game with incomplete information that we have studied When is there an equilibrium such that the high-cost type of Firm 2 produces nothing, and what does it look like? Problem Suppose there are two consumers and one public good The consumers simultaneously contribute an amount of money x i 2 [0,a i ] for this good, where a i is the wealth of consumer i The resulting quantity of public good is y(x 1,x 2 ) = x 1 + x 2 The preferences of consumer i is given by the (Cobb-Douglas) utility function u i (x 1,x 2 ) = y(x 1,x 2 )(a i x i ) It is common knowledge that a 1 =1, but a 2 is known only to consumer 2 Player 1 assigns probability 1/2 to the event a 2 = a L = 05 and probability 1/2 to the event a 2 = a H = 15 The probabilities are common knowledge Find the unique equilibrium of this game 24