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

Size: px
Start display at page:

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

Transcription

1 DEPARTMENT OF ECONOMICS YALE UNIVERSITY P.O. Box New Haven, CT Economics Department Working Paper No. 25 Cowles Foundation Discussion Paper No Information Acquisition in Interdependent Value Auctions Dirk Bergemann, Xianwen Shi, and Juuso Välimäki July 2007 This paper can be downloaded without charge from the Social Science Research Network Electronic Paper Collection:

2 Information Acquisition in Interdependent Value Auctions Dirk Bergemann Xianwen Shi Juuso Välimäki July 20, 2007 Abstract We consider an auction environment with interdependent values. Each bidder can learn her payoff type through costly information acquisition. We contrast the socially optimal decision to acquire information with the equilibrium solution in which each agent has to privately bear the cost of information acquisition. In the context of the generalized Vickrey-Clarke-Groves mechanism, we establish that the equilibrium level exceeds the socially optimal level of information with positive interdependence. The individual decisions to acquire information are strategic substitutes. The difference between the equilibrium and the efficient level of information acquisition is increasing in the interdependence of the bidders valuations and decreasing in the number of informed bidders. Jel Classification: C72, C73, D43, D83. Keywords: Vickrey-Clarke-Groves Mechanism, Information Acquisition, Strategic Substitutes, Informational Efficiency. We thank the participants of the IESE Conference on Complementarities and Information for helpful comments. We thank the conference discussant, Tim Van Zandt, for many constructive comments that substantially improved the paper. This research is partially supported by NSF Grants #CNS and #SES Department of Economics, Yale University, New Haven, CT , U.S.A., Department of Economics, Yale University, New Haven, CT , U.S.A., Department of Economics, Helsinki School of Economics and University of Southampton, Helsinki, Finland, 1

3 Information Acquisition in Interdependent Value Auctions July 20, Introduction 1.1 Motivation In the vast literature on auctions, surprisingly few papers have focussed explicitly on costly information acquisition. This is somewhat puzzling given the close connections between auctions and price formation processes in competitive markets. Milgrom (1981) uses a multiunit Vickrey auction model to illustrate the possible coexistence of costly information and efficient information aggregation. The connections to the rational expectations equilibrium have been since worked on extensively but the issue of information acquisition has received a lot less attention. In our view, the questions relating to socially optimal information acquisition remain open for a large class of auction models. If the auction designer has a utilitarian welfare objective and valuations are independent, it is easy to see that the agents have the correct incentives to acquire information in a socially optimal manner. In the Vickrey auction, individual payoffs, when viewed as functions of own type only, coincide with the sum of payoffs to all players (up to the addition of a constant). As a result, private incentives coincide with those of the planner. If valuations are interdependent, however, private incentives differ from those of the planner. Maskin (1992) and Bergemann and Välimäki (2002), among others, have shown that given the decisions by other bidders, individual bidders have too strong incentives to acquire information if their valuations are positively dependent. Since these papers consider only individual deviations, it is impossible to compare centralized and decentralized information acquisition decisions. In this paper, we analyze equilibrium information acquisition in a model with binary information decisions where the bidders true payoff types are initially unknown and each bidder may observe a costly private signal revealing her true payoff type. In a linear model with positive dependence, we show that: (i) the private value of information exceeds the social value of information everywhere, (ii) the private value of being informed is decreasing in the number of informed bidders. Property (i) confirms the results in Bergemann and Välimäki (2002), and property (ii) means that bidders information decisions are strategic substitutes. Property (ii) insures that the local comparison can be extended to the equilibrium comparison. That is, with positive dependence, more bidders become informed in the equilibria of the information acquisition game than in the social planner s solution.

4 Information Acquisition in Interdependent Value Auctions July 20, Our basic model is a single-unit auction where bidders acquire (covertly) information about their true valuations simultaneously prior to the auction stage. Their valuations are assumed to be linear in the signals of both their own and their opponents. A generalized Vickrey-Clarke-Groves (VCG) mechanism is used to allocate the object. We consider pure strategy equilibrium as well as mixed strategy equilibrium of this game of information acquisition. For both types of equilibria, information decisions of bidders are strategic substitutes and the equilibria feature socially excessive information acquisition. Moreover, the difference between equilibrium level of information and efficient level of information diminishes as the strength of positive dependence weakens or as the number of informed bidders increases. Since information acquisition is a binary decision, the pure strategy equilibrium may be asymmetric: in equilibrium some bidders acquire information while others do not. In this case, we show that more bidders become informed in equilibrium than in a planner s solution. For the mixed strategy equilibrium, we focus on the symmetric one. The relevant comparison in the information acquisition game is the problem where the planner chooses the same probability of becoming informed for all bidders. By this choice we can concentrate solely on the informational externalities in the problem rather than the coordination problems arising due to mixing. Again, our results show that the equilibrium probability of information acquisition exceeds the socially optimal probability. In Appendix B, we show that the basic insights of the single-unit auction carry over to a model where multiple objects are sold but bidders have unit demands. Furthermore, we extend our positive results to a nonlinear model which nests the specification with constant absolute risk aversion as a special case. We confirm both property (i) and (ii). However, it is difficult to obtain similar results in a general nonlinear setting. The main reason is the following. In nonlinear models, the ranking of two agents valuations, depends in general on the signal realization of a third agent. Thus, the third agent s decision to acquire information produces socially valuable information for the allocation decision between the first two agents. This is possible even in situations where the third agent does not receive the object and the private value of her information is zero. Consequently, this may lead to the reversal of ranking between private value of information and social value of information. That is, property (i) may be violated. In the paper, we also present an example to show why property (ii) is important for our positive results. In the example, bidders valuations are positively dependent and individual

5 Information Acquisition in Interdependent Value Auctions July 20, incentives to gather information are higher than social incentives. But information decisions are strategic complements, and thus violate property (ii). We show that the equilibrium level of information may be insufficient comparing to the social optimal one. For most of the paper, we focus on the case where payoffs conditional on the allocation depend only on the bidders true payoff types. This specification corresponds to the case where the types represent specific pieces of independent information about the true value of the object for sale. We also contrast this with a model where the valuations depend on the signals observed by the bidders. This latter model can be seen as a reduced form of a game where the initial auction stage is followed by an investment decision that depends on the reports in the auction stage. For example, the value of a license to operate in several markets will depend on the profitability of each market, which is private information of the firms operating in that market. For the latter specification, information acquisition decisions remain strategic substitutes but individual incentives to acquire information is socially insufficient. Therefore, property (i) is violated. There are two reasons for considering this alternative model. First of all, it shows that in a model with information acquisition, the results depend delicately on whether payoffs are defined in terms of payoff types (even those that remain unknown to all bidders at the auction stage) or signals. Second, this alternative specification serves as a caveat when thinking about our results implications for real world auction design. 1.2 Related Literature Grossman and Stiglitz (1980) propose a standard rational expectations model to address a fundamental issue in economics: How does the market adjust to new information. In their model, ex ante identical and uninformed market traders can acquire information with cost and use it to make a profit by trading a risky asset. The fluctuation of prices makes private information (partially) revealed to uninformed traders. They conjecture that if information is costly, then equilibrium market prices cannot fully reveal private information. Furthermore they argue that costless information is not only sufficient, but also necessary for efficient market. Another important conjecture is that information acquisition decisions are strategic substitutes, the more individuals are informed, the less valuable is the information. Traders in Grossman and Stiglitz (1980) are assumed to be price-taking. This assumption is criticized in Milgrom (1981) who argues that this assumption underlies the famous im-

6 Information Acquisition in Interdependent Value Auctions July 20, possibility result in Grossman and Stiglitz (1980). On the other hand, Barlevy and Veronesi (2000) show that information acquisition decisions might be strategic complements under a different model specification. They show this by relaxing the standard exponential utility and normal error distribution assumptions but maintaining the price-taking behavior of the agents. Milgrom (1981) suggests a resolution of the Grossman and Stiglitz paradox by explicitly modelling price formation. A multi-unit Vickrey common value auction with finite number of objects is proposed to illustrate the possible coexistence of costly information and efficient information aggregation. The equilibrium is shown to be an ex post Nash equilibrium. Thus, the bidders behavior is very similar to the traders in the rational expectation equilibrium model. The process of price formation, however, is explicitly modelled here and the pricetaking assumption is fully justified. He argues that there is no tension in this model between the incentives to gather information and the informational efficiency of prices. Milgrom (1981) results are extended and his assumptions are relaxed in Pesendorfer and Swinkels (1997) (2000). Pesendorfer and Swinkels (1997) extends Milgrom s common value framework by allowing the number of objects to grow as well as the number of bidders. They show that when both the number of objects and the number of bidders who do not receive an object becomes large, uniform price auctions are informationally efficient. In Pesendorfer and Swinkels (2000), a private component is introduced, so there is a tension between allocation efficiency and information aggregation. When the number of bidders and objects grow proportionally (the ratio of objects to bidders is bounded between 0 and 1), they show that both allocation efficiency and information aggregation are achieved in the limit. Similar to Pesendorfer and Swinkels (2000), Jackson (2003) studies a uniform price auction with both private and common component, but assumes that information about the common component is costly to obtain. In the presence of information cost, he shows that informational efficiency is not robust even to small information costs. 1 1 The result in Jackson (2003) seems to be contradictory to Milgrom (1981). The reason is that they use different notions of informational efficiency. Jackson (2003) requires that the price approximates the true value of the good, while Milgrom (1981) requires that the price fully reveals private information acquired by the market participants. In terms of Jackson s criterion, the level information acquired in Milgrom s model may be insufficient. This suggests that it is important to have an efficiency criterion within a model as in this paper.

7 Information Acquisition in Interdependent Value Auctions July 20, All these papers focus on information aggregation in large markets given endowed or acquired information. Other equally important questions are: does equilibrium information acquisition coincide with the socially optimal level? What types of models generate excessive information in equilibrium and what types of models lead to insufficient investment in information? These are the focus of the current paper. In the models mentioned above, either the object has pure common value or the common component of the object is the same for everyone, and hence the socially optimal level of information is always zero for allocation purposes. Thus, these specifications are not suitable for our analysis. The specifications contained in the current paper introduce a more general positive dependence into the model, and thus allow us to compare equilibrium level of information to the social efficient level of information. Another strand of literature has studied the incentives for information acquisition in specific auction formats. Stegeman (1996) shows that first and second price IPV auctions result in the same incentives for information acquisition. Matthews (1984) analyzes information acquisition in affiliated private values auctions and compares the resulting revenues to the auctioneer. Finally, Persico (2000) compares the revenues from first and second price auctions in a general affiliated model where the bidders invest in information prior to participating in the auction. The main focus of these papers is on the revenue generating properties of the various formats. As a result, they say little about the overall level of information acquisition from the social welfare point of view. This paper is organized as follows. Section 2 sets up the model. Section 3 presents the pure strategy analysis of the single unit auction with a linear payoff structure. Section 4 derives the mixed strategy equilibrium in this environment. Section 5 extends the analysis to nonlinear payoff environments. Section 6 discusses the role of the strategic substitute property and the role of the positive interdependence for the private excess returns from information. Finally, Section 7 concludes. The proofs of all results are delegated to Appendix A, and Appendix B contains the analysis of multi-unit auctions.

8 Information Acquisition in Interdependent Value Auctions July 20, Model We consider an auction setting with a single object for sale and I bidders. The true value of the object to bidder i is given by u i (θ i, θ i ) = θ i + α θ j, (1) j i where 0 α 1. The parameter α is a measure of the positive interdependence. If α = 0, then the model is one of private values and if α = 1, then the model is of pure common values. Each agent i has a quasilinear utility: where t i R is a monetary transfer. u i (θ) t i Initially, each bidder i only knows that the payoff relevant types {θ j } I j=1 are independently drawn from a common distribution F with support [ θ, θ ] R +. The distribution F has an associated density f and a mean valuation: µ E [θ i ]. Each bidder i can acquire information about her payoff relevant type θ i at a positive cost c > 0. The decision to acquire information is a binary decision. If bidder i acquires information, then she observes the realization of θ i ; otherwise her information is given by the prior distribution F. We consider the possibility of informational efficiency in an efficient allocation mechanism, namely the generalized Vickrey-Clarke-Groves mechanisms (see Maskin (1992) and Dasgupta and Maskin (2000)). A necessary and sufficient condition for the implementability of the efficient allocation is that u i (θ i, θ i ) satisfies the single crossing property. In the current linear setting, the single crossing condition is equivalent to α 1. We denote by y i the highest signal among bidders other than i, that is, y i = max θ j. j i The generalized Vickrey-Clarke-Groves (VCG) mechanism is defined by an allocation rule 1 if θ i > y i, q i (θ i, θ i ) = (2) 0 if θ i < y i,

9 Information Acquisition in Interdependent Value Auctions July 20, which specifies the probability of winning conditional on the reported type profile θ. In case of a tie among the highest types, the winner is chosen among the tied bidders with equal probability. The associated payment rule u i (y i, θ i ) if θ i > y i, t i (θ i, θ i ) = 0 if θ i < y i, specifies the payment of bidder i. The winning bidder makes a payment which is equal to her value of the object conditional on tying the payoff type of the second highest bidder. Consequently, the equilibrium payoff for a bidder i at type profile θ i is θ i y i if θ i y i, q i (θ) u i (θ) t i (θ) = 0 if θ i < y i. In the generalized VCG mechanism, the payment of agent i is independent of the report of agent i conditional on the allocation and the equilibrium is an ex post Bayesian Nash equilibrium (see Dasgupta and Maskin (2000)). With the linear specification of payoff types given by (1), the expected value of an uninformed bidder is the same as that of an informed bidder with a true payoff type θ i = µ. The direct revelation mechanism therefore does not have to account for informed and uninformed bidders separately. In section 5 we shall look at environments in which the valuation function is not linear in the types θ i and then an uninformed agent will have to report her entire distributional information rather than the mean µ only. (3) 3 Pure Strategy Equilibrium We first establish the socially optimal information policy. Subsequently, we analyze the equilibrium information policies of the agents in the generalized VCG mechanism. Initially we focus our attention on the pure strategy equilibria and consider the mixed strategy equilibrium in the next section. 3.1 Socially Efficient Policy The bidders are ex ante identical. The socially optimal policy has to weigh the benefits of increasing information against the cost of additional information. The social value of additional information arises from the possibility of identifying an agent with a higher valuation.

10 Information Acquisition in Interdependent Value Auctions July 20, As the number of informed agents increases, it becomes increasingly unlikely that an additionally informed agent will have a valuation exceeding the highest valuation among the currently informed agents. The optimal number of informed agents will therefore depend on the prior distribution and the cost of information acquisition. We denote the set of informed agents by {1,..., m} and the remaining set of uninformed agents by {m +1,..., I}. The agent m is the marginally informed agent. We denote by θ h the highest payoff type among the (m 1) informed bidders, and denote the informed bidder with payoff type θ h as bidder h. It is straightforward to characterize the expected social gain of the m-th informed agent. The information of the m-th agent improves the social efficiency if and only if the information is pivotal for the allocation decision. By the single crossing condition, the information of agent m is pivotal if and only if it leads the planner to allocate the object to agent m. If the payoff type of agent m exceeds the types of all other agents, then it has to be larger than the payoff types of all informed agents {1,..., m 1} as well as all uninformed agents {m + 1,..., I}. Without loss of generality, we may assume that if the object is optimally assigned to an uninformed agent, then it is assigned to agent I. The expected social gain of informing agent m, denoted by m, is then given by: m = E θ [(u m (θ) u h (θ)) 1(θ m θ h µ) + (u m (θ) u I (θ)) 1 (θ m µ > θ h )], (4) where the indicator function 1 ( ) is defined as 1 if event A is true, 1(A) = 0 if event A is false. If bidder m becomes informed, then she may either win against bidder h or bidder I, respectively. The size of the expected gain from the improved allocation is the corresponding difference in the valuations between bidder m and the current winner. We can use the linear structure of the valuation u i (θ) to rewrite (4) as: E θ [((θ m θ h ) + α (θ h θ m )) 1(θ m θ h µ) + ((θ m µ) + α (µ θ m )) 1 (θ m µ > θ h )]. With the linear payoff structure, the expected gain from information depends only on θ m and the highest payoff type among the remaining agents, θ h or µ. We denote by y m the highest payoff type among all agents exclusive of m: y m = max j m θ j = max {θ h, µ}. (5)

11 Information Acquisition in Interdependent Value Auctions July 20, We can now write m in a more compact form as: m = (1 α) E θm,y m [(θ m y m ) 1(θ m y m )]. (6) The case of m = I is slightly different. If the last bidder I is becoming informed, then indeed all bidders are informed. The information of bidder I now becomes pivotal in two different circumstances: (i) θ h > µ and (ii) θ h < µ. In the first case, bidder I did not get the object without additional information, but may now receive the object. In the second case, bidder I did get the object without information, but may now fail to get the object if her true payoff type turns out to be below θ h. 2 is then given by: The expected social gain from information I = E θ [(u I (θ) u h (θ)) 1 (θ I θ h µ) + (u h (θ) u I (θ)) 1 (µ > θ h > θ I )]. (7) By using the linear structure of the model, we can rewrite (7) to obtain: I = (1 α) E θi,θ h [(θ I θ h ) 1 (θ I θ h µ) + (θ h θ I ) 1 (µ > θ h > θ I )]. (8) We denote the socially optimal decision to acquire information for the m-th agent by s m {0, 1}. Then we can state the social efficient policy as follows. Proposition 1 (Social Efficient Policy) 1. The socially efficient policy s m is given by: 0 if s m < c, m = 1 if m c. 2. m is strictly decreasing in m and α for all m. The social gain from of an additional informed bidder is positive when the information is pivotal with positive probability. When more bidders are informed, it is less likely that the newly informed bidder has a payoff type higher than those of her opponents. Therefore, 2 The difference in the analysis of the marginal bidder m for m < I and m = I is only due to our initial choice of selecting the last agent I to be the winning agent among all uninformed agents. Alternatively, the social planner could have randomized the assignment among the uninformed agents (conditional on the uninformed winning). In this case, the complicating effect for agent I would have already appeared for all agents before I.

12 Information Acquisition in Interdependent Value Auctions July 20, the gross social gain from information acquisition is decreasing in the number of informed bidders. With positive dependence, the efficiency loss from misallocation is lower than in an environment with private values. A larger α, which represents a higher positive interdependence, leads to a smaller loss from the misallocation due to the imperfect information. In consequence the social gain from information acquisition is smaller when bidders valuations are more positively dependent. 3.2 Equilibrium Policy We now consider the private incentives of the agent to acquire information in the generalized VCG mechanism. We maintain the notation and identify bidder m as the marginal bidder to acquire information. We denote the expected private gain of agent m to become informed by m. As in the socially optimal program, we assume that if an uninformed agent is assigned the object, then it is assigned to the last agent I. If there are multiple uninformed agents, then the resulting monetary transfer will leave agent I indifferent between receiving and not receiving the object. With this convention, it is again useful to treat the case of m < I and m = I separately. The marginal bidder m gains from gathering information if and only if she wins the object with the information. In the generalized VCG mechanism, the m-th bidder s net gain from information is: m = E θ [(u m (θ m, θ m ) u m (y m, θ m )) 1(θ m y m )], where we defined y m earlier in (5) as the highest payoff type among all bidders other than m. We can use the linear payoff structure (1) to rewrite m : m = E θm,y m [(θ m y m ) 1(θ m y m )]. (9) We compare the private gain with the social gain of information as described by (6) and (9), respectively. If bidder m s information is not pivotal, then both the private and the social value of information about the payoff type θ m is equal to zero. On the other hand, when bidder m s signal is pivotal, then the private gain from information about θ m is given (θ m y m ), but social gain from information is only (1 α) (θ m y m ). The difference between the private and the social gains stem from the requirement of incentive compatibility. If agent m is to report truthfully, then she can only be asked to pay a monetary transfer

13 Information Acquisition in Interdependent Value Auctions July 20, equal to the lowest possible type at which the planner would be indifferent between assigning and not assigning the object to bidder m. In particular for all payoff types above her pivotal type, the monetary transfer has to stay constant, but her private benefit increases at the rate of 1. In contrast, in the social program, the marginal benefit from an increase in the payoff type of agent m is given by (1 α) (θ m y m ) as a higher payoff type of agent m would already be beneficial at the rate α even if agent m is not assigned the object. Thus the social benefit of an increase in the payoff type of agent m is moderated by the interdependence of the valuations. As we discussed in the context of the socially efficient policy, the description of the bidder s gain from information is somewhat different in the case of m = I. We have: I = E θ [(u I (θ I, θ I ) u I (θ h, θ I )) 1 (θ I θ h µ)] + E θ [(u I (θ h, θ I ) u I (θ I, θ I )) 1 (µ > θ h > θ I )], and using the linear payoff structure we get: I = E θi,θ h [(θ I θ h ) 1 (θ I θ h µ) + (θ h θ I ) 1 (µ > θ h > θ I )]. (10) The first term represents bidder I s gain by winning the object from the informed bidder h when her payoff type is higher than the payoff type of the remaining agents. The second term represents bidder I s gain by avoiding to pay more for the object than it is worth to her given that her true payoff type is lower than θ h. By analogy, we refer to the equilibrium decision of agent m to acquire information by ŝ m {0, 1}. Proposition 2 (Equilibrium Policy) 1. The equilibrium information policy is given by 0 if m < c, ŝ m = 1 if m c. 2. m is strictly decreasing in m and constant in α for all m. The private decisions of the agents to acquire information are again strategic substitutes: bidder i is less willing to become informed as more of her opponents are informed. When one more opponent gets informed, a bidder s expected gain from information acquisition is reduced in two ways. First, her chance of winning is lower. Second, conditional on winning,

14 Information Acquisition in Interdependent Value Auctions July 20, her expected gain from winning is lower. Thus, if there are more informed opponents, a bidder s incentives to acquire information are lower. This property ensures that the game of information acquisition has an essentially unique pure strategy equilibrium for any given level of information cost. 3.3 Welfare Comparison We can now contrast the information decisions in the social and the equilibrium program by comparing the marginal gains of information given by { } I { m} I m=1 and m. m=1 We use the strategic substitute property to guarantee the uniqueness of the equilibrium. Proposition 3 (Welfare Analysis) For all m, 1. the marginal gains of information satisfy: m m; 2. the equilibrium information acquisition is (weakly) socially excessive; 3. the difference m m is increasing in α; 4. the difference m m is decreasing in m. With positive dependence, the equilibrium gain for a bidder to acquire information is higher than the social gain. This result, together with the strategic substitute property, implies that given any level of information cost, more bidders get informed in equilibrium than desired in the social optimum. The discrepancy between equilibrium and social policy decreases as more bidders are informed and as the positive interdependence weakens. The statement about the comparison between the private value and the social value of information, m m, is weaker than what is actually established in the proof of the proposition. The first part of the above proposition says that on average the social value of information is lower than the private value of information. In fact, the social value of information is lower than the private value of information at every possible profile of payoff

15 Information Acquisition in Interdependent Value Auctions July 20, types. To see this, notice that when bidder m s signal is not pivotal, both social value and private value of information about θ m is zero. On the other hand, when bidder m s signal is pivotal, the private gain from information about θ m is (θ m y m ), but the social gain from information is (1 α) (θ m y m ), which is smaller as long as α > 0. The current results for the single unit auction generalize naturally to the case of multiunit auctions with the associated generalized VCG mechanism. The precise statements and proofs for the multi-unit case are contained in Appendix B. 4 Mixed Strategy Equilibrium So far we restricted our attention to the analysis of pure strategy equilibria and we showed that the pure strategy equilibrium is unique up to permutations of the ex ante identical bidders. Similarly, a socially efficient decision is always a deterministic policy. The pure strategy equilibrium is frequently an asymmetric equilibrium in that some bidders acquire and some bidders do not acquire information even though the bidders are ex ante identical. It may be difficult to see how this type of coordination might be achieved in a one-shot game. As a result, it is of interest to also analyze the symmetric mixed strategy equilibria of the game.. The mixed strategy equilibrium leads almost by definition to a socially inefficient information policy since the agents frequently fail to coordinate their decision. In order to facilitate a comparison with a socially optimal solution, we consider the problem of a planner who is restricted to choose an anonymous and hence symmetric information policy across all agents. Under this restricted efficiency criterion we conclude, as in our earlier analysis, that the equilibrium level of information acquisition will be higher than the socially efficient level. In the current model, the cost of information acquisition is known and identical to all the bidders. It is natural to extend the model to allow for differential costs of information acquisition. If the cost of information acquisition were private information, then we can think of the mixed strategy equilibrium here as the limit equilibrium of a model with private information about the cost of information acquisition. By a standard argument first suggested by Harsanyi (1973), the mixed strategy equilibrium here can then be purified by a model with private information about the cost of information.

16 Information Acquisition in Interdependent Value Auctions July 20, We restrict our analysis here to the case of moderate information cost so that the bidders acquire information with a probability strictly between 0 and 1. The case of very low and very high information costs would of course lead to degenerate mixed strategies and the only complication would come from the qualification to weak inequalities rather than equalities in the equilibrium conditions. We denote by σ (0, 1) the socially optimal probability of acquiring information, and by σ (0, 1) the equilibrium probability of acquiring information. With slight abuse of notation, we define the expected gain from information function for a representative agent by (σ), and we have: (σ) I m=1 ( ) I 1 σ m 1 (1 σ) I m m 1 m. We recall that m is the expected social gain from an additional informed bidder when (m 1) bidders have already acquired information. The expected gain (σ) represents the expected social gain from information when the planner is required to choose a single probability σ of acquiring information for all bidders. Similarly, we define (σ) as (σ) I m=1 ( ) I 1 σ m 1 (1 σ) I m m, m 1 where m is the individual gain for bidder m to acquire information when (m 1) bidders are already informed. In the symmetric mixed strategy equilibrium, individual bidders must be indifferent between acquiring information and staying uninformed. The expected relative gain from acquiring information must be equal to the cost of information. Thus, the equilibrium policy σ must satisfy the following condition: ( σ) c = 0. (11) Similarly, for the socially efficient policy σ, the expected social gain from information must be equal to the information cost: (σ ) c = 0. (12) Proposition 4 (Strategic Substitutes) The gains from information, (σ) and (σ), are strictly decreasing in σ. The private and the social gain of a bidder from information acquisition are thus decreasing as the probability of other buyers being informed increases. That is, the decisions to

17 Information Acquisition in Interdependent Value Auctions July 20, acquire information remain strategic substitutes when we allow for probabilistic policies. It also ensures that there are unique probabilities σ and σ that satisfy equilibrium conditions (11) and (12), respectively. Proposition 5 (Excessive Information Acquisition) For all σ (0, 1): σ < σ. Thus the bidders have a higher probability of acquiring information in equilibrium than in the social optimum. Proposition 4 and Proposition 5 extend the previous results in the pure strategy analysis to the symmetric mixed strategy equilibrium. 5 Nonlinear Interdependence We now investigate to what extent the results obtained in the linear payoff model generalizes to nonlinear environments. 3 We introduce a new condition, referred to as no-crossing property, which guarantees that the ranking of any two bidders is unaffected by the payoff type of a third bidder. We then show that the class of constant absolute risk averse utility functions jointly with a linear aggregation model of the payoff types satisfies the no-crossing property. We consider general nonlinear valuation functions given by: u i : [ θ, θ ] I R. We maintain a symmetric framework across agents. Specifically we require that for all i and j and all payoff type profiles θ and θ, if θ is a permutation of θ and θ i = θ j, then u i (θ) = u j (θ ). We also maintain the single crossing condition in order to guarantee the truthful implementation of the efficient allocation by means of the generalized VCG mechanism: θ i θ j u i (θ) u j (θ). (13) Finally, the positive interdependence in the nonlinear setting simply requires that u i (θ) θ j > 0, i, j, θ. 3 We would like to thank our discussant, Tim van Zandt, who asked us to further develop the nonlinear environment and who suggested the no crossing condition.

18 Information Acquisition in Interdependent Value Auctions July 20, Clearly, the earlier linear payoff model belongs into the environment considered here. The symmetry assumption is restrictive but natural. The single-crossing property is necessary to implement the efficient allocation. The positive dependence is necessary to guarantee that the individual returns from information exceed the social returns from information. Within this setting, we introduce the no crossing property. Without loss of generality, we label the set of informed bidders by {1,..., m}. Assumption 1 (No Crossing Property) The valuations {u i (θ)} I i=1 satisfy the no-crossing property if for all m and all i, j m : θ m s.t, E [u i (θ) θ 1,..., θ m ] > E [u j (θ) θ 1,..., θ m ] θ m, E [u i (θ) θ 1,..., θ m ] > E [u j (θ) θ 1,..., θ m ]. It is easy to verify that the earlier linear payoff model satisfies the no-crossing property. The no-crossing property requires that the ranking of the expected payoff of two alternatives, i versus j, is constant across all payoff types θ m of agent m. If all agents are informed about their payoff type and m = I, then the no-crossing property is automatically satisfied by the single crossing condition (13) which simply states that the binary ranking of the alternatives i and j is determined exclusively by their respective payoff types θ i and θ j. The no-crossing property condition extends the uniformity of the binary ranking to the comparison of two bidders i and j, where i is informed about her payoff type and j is not informed about her payoff type. If the no-crossing property is violated, then the information of agent m may be socially valuable in determining the allocation between i and j without agent m ever getting the object. But if agent m does not receive the object, then she will have very weak private incentives to acquire information even though it would be socially valuable. In consequence, the ranking between the social incentive and the private incentive to acquire information may be reversed. The no-crossing condition has an important implication. Lemma 1 If the no-crossing property is satisfied, then for all m and all i, j m, if E [u i (θ) θ 1,..., θ m 1 ] > E [u j (θ) θ 1,..., θ m 1 ], then E [u i (θ) θ 1,..., θ m ] > E [u j (θ) θ 1,..., θ m ]. In words, the rank between bidder i and j after bidder m gets informed is the same as the rank between them before bidder m becomes informed. The definition of the marginal

19 Information Acquisition in Interdependent Value Auctions July 20, gains from information, given by m and m, extends in the natural way to the nonlinear environment. The next proposition shows that the private gain from acquiring information will be higher than the social gain from information. Proposition 6 (Excessive Incentives) If the no-crossing property is satisfied, then m > m for all m. The following graph illustrates the no-crossing property and the difference between private value and social value of information. The no-crossing property requires that the two curves E [u i (θ) θ 1,..., θ m ] and E [u j (θ) θ 1,..., θ m ] do not cross each other for all θ m, as shown in the graph. In addition, the curve E [u m (θ) θ 1,..., θ m ] crosses both E [u i (θ) θ 1,..., θ m ] and E [u j (θ) θ 1,..., θ m ] only once, which is implied by our single-crossing assumption. E E E [ ( θ ) θ,..., θ ] u m 1 [ ( θ ) θ,..., θ ] E u z m m, m 1 m m [ u i ( θ ) θ1,..., θm] [ ( θ ) θ,..., θ ] u j 1 m zm θm Figure 1: No-crossing property, private gain and social gain from information Now we can use the graph to illustrate why the private gain from information is higher than the social gain from information. Let s consider the information decision of the marginal bidder m. Suppose bidder i has the highest valuation among bidder m s opponent and let z m solve the following equation E [u m (θ) θ 1,..., θ m 1, z m ] = E [u i (θ) θ 1,..., θ m 1, z m ].

20 Information Acquisition in Interdependent Value Auctions July 20, That is, z m is the cutoff signal that bidder m will overtake bidder i as the winner of the object. In the graph, z m is the value where the curves E [u m (θ) θ 1,..., θ m ] and E [u i (θ) θ 1,..., θ m ] cross. If θ m < z m, then the social planner will assign the object to bidder i, and both private value and social value of information about θ m are zero. On the other hand, if θ m z m, the social planner will assign the object to bidder m, and the social gain from information is E [u m (θ) θ 1,..., θ m 1, θ m ] E [u i (θ) θ 1,..., θ m 1, θ m ]. (14) In order to induce bidder m to tell the truth, the payment of the generalized VCG mechanism must be independent of θ m conditional on allocation. In the graph, bidder m s payment conditional on winning is the dashed horizontal line: E [u m (θ) θ 1,..., θ m 1, z m ] or E [u i (θ) θ 1,..., θ m 1, z m ] Therefore, the private gain from information about θ m is E [u m (θ) θ 1,..., θ m 1, θ m ] E [u i (θ) θ 1,..., θ m 1, z m ]. (15) Comparing expression (14) and (15), we can see that, for any realization of θ m z m, the private gain exceeds the social gain from information by E [u i (θ) θ 1,..., θ m 1, θ m ] E [u i (θ) θ 1,..., θ m 1, z m ] which is always positive because E [u i (θ) θ 1,..., θ m 1, θ m ] is increasing in θ m. Integrating the difference with respect to the density of θ m, we can obtain the expected difference between the private gain and the social gain from information, as indicated by the shaded area in the graph. Next we demonstrate that the private decisions of the bidders to acquire information will remain strategic substitutes in the nonlinear environment, provided that the no-crossing property is satisfied. In consequence, the pure strategy equilibrium in the nonlinear environment will be unique and the equilibrium will necessarily display excessive information acquisition compared the socially optimal solution. Proposition 7 (Strategic Substitutes) For all m < I: m m 1.

21 Information Acquisition in Interdependent Value Auctions July 20, The current result is stated and proved only for m < I. While we suspect that it will naturally extend to the final bidder, we have not been able to prove this result in the nonlinear setting. A leading example of the no crossing property is the class of constant absolute risk aversion utilities with a linear payoff type structure. Consider the valuation function u i (θ) given by: [ ( u i (θ i, θ i ) = 1 exp r θ i + α )] θ j, (16) j i with a coefficient of absolute risk aversion r > 0 and α (0, 1). It is easy to verify that the valuation model given by (16) is symmetric, satisfies the single crossing condition and displays positive interdependence. The no-crossing property is satisfied as the payoff types are multiplicatively separable under the exponential utility function and the linear type structure. It is further apparent that the no-crossing condition is valid for any multiplicative separable specification of the valuation function. If the payoff functions are neither additively nor multiplicatively separable, then the nocrossing property may be violated. This is easily shown with the following example of three bidders, i {1, 2, 3}. The valuation of bidder i is given by: u i (θ) = (1 + θ i ) 2 + (θ j + θ k ) θ j θ k. (17) The payoff types θ i are assumed to be independently drawn from the uniform distribution on the unit interval. Clearly, the model is symmetric, satisfies the single-crossing property and displays positive interdependence. Within the example given by (17) it is now easy to show that the ranking of an informed agent, say 1 and an uniformed agent, say 3, is affected by the payoff type of agent 2. We omit the calculations. 6 Positive Interdependence The analysis of the auction environment began with positive interdependence of the payoff types. We established that the private and the social decisions to acquire information are strategic substitutes and that the private returns from information exceed the social returns from information. Consequently, it might be plausible to deduce that the driving force behind the results is the positive interdependence of the payoff types. In this section, we show that positive intrdependence is not sufficient to make information acquisition decisions

22 Information Acquisition in Interdependent Value Auctions July 20, strategic substitutes. In order to obtain the result on excessive information acquisition, a separate argument for the strategic substitute property is needed. 6.1 Strategic Complements With positive interdependence, Bergemann and Välimäki (2002) show that the individual bidders will have socially excessive incentives to acquire information given the information decision of the remaining agents. The results in Bergemann and Välimäki (2002) are thus about a local property of the decision of agent i in the sense that the decision of the remaining agents are kept constant. In particular, the characterization of the individual decision may not transfer to the equilibrium decisions of the agents. We now provide an example of positive interdependence with the property that the decisions to acquire information are strategic complements rather than strategic substitutes. Despite the positive interdependence, an equilibrium of the game will display a lower level of information acquisition than the social equilibrium. Suppose there are two bidders, i {1, 2}, competing for single object. The payoff structure is the linear payoff structure of the previous sections: u i (θ i, θ j ) = θ i + αθ j, but we now allow for negative payoff types. The social planner can either allocate the object to bidder 1 or 2 or decided not to allocate the object at all. In particular it is efficient not to assign the object if the expected valuation of both bidders is below zero. For concreteness, we consider α = 0.5 and assume that the payoff types θ i are independently drawn from the uniform distribution with the support given by [ 5, 1]. It is now easy to verify that the decisions to acquire information are strategic complements. If bidder j stays uninformed, then it is efficient not to assign the object to bidder i for any realization of her payoff type. In consequence, the value of information for agent i is zero if agent j does not acquire information. On the other hand, if agent j does acquire information, then a positive realization by both agents may lead to the assignment of the object to agent i and hence there is positive value of information. Therefore, consistent with the analysis of Bergemann and Välimäki (2002), the private gain is weakly higher than the social gain from information. But the analysis of the individual decision of agent i does not necessarily translate into a corresponding equilibrium

23 Information Acquisition in Interdependent Value Auctions July 20, characterization. For example, we can show by elementary computations that if the cost of information is c = 1/100, then the efficient policy requires that both bidders acquire information. However, due to the strategic complementarity, there are now two pure strategy equilibria for the game of information acquisition: one in which both bidders remain uninformed, the other one in which both bidders become informed. It is therefore possible that the two bidders fail to coordinate on the efficient equilibrium and stay uninformed. 4 The key for the failure of the equilibrium characterization is that the private gain from information is increasing in the number of informed bidders, that is, information decisions are strategic complements. 6.2 Privately versus Socially Pivotal Signals The next class of allocation problems also represent a natural departure from the initial model. There are I agents and the value of the assignment to a bidder is determined by her own payoff type as well as the K highest payoff types among the remaining bidders, with K < I 1. In other words, the agents with the lowest payoff types do not matter. More precisely, the value of the assignment to bidder i is given by: K u i (θ) = θ i + α y ik, (18) k=1 where y ik is the k-th highest signal among the remaining agents exclusive of i. We may interpret the model as one in which an exclusive license is auctioned among I bidders. The license gives the winner the right to operate in her own market and in the K most valuable neighboring markets. The value of the license to operate in K markets depends consequently on the K highest signals. The difference between this license model and the earlier single unit auction model is easily understood by distinguishing between privately pivotal and socially pivotal information. In the license auction, an information is privately pivotal if it affects the identity of the winning bidder. Yet, an information can be socially pivotal if it changes the determination of the neighboring markets in which the winner will operate. In the single unit auction model, 4 We note that the negative payoff types are not necessary to generate the strategic complementarity in the information decision among the agents. A similar result could be generated in an asymmetric three bidder model with positive types in which the information of agent i is relatively more important for agent j than for agent k.

24 Information Acquisition in Interdependent Value Auctions July 20, a socially pivotal signal must be a privately pivotal signal as well. Yet, in the current license model, a signal could be socially pivotal but not privately pivotal. For simplicity we shall assume that the expected value of every market is given by µ = 0 and hence only informed agents can provide efficient licensing agents (and markets). The assignment rule of the associated VCG mechanism is given by: 1 if θ i > y i1, q i (θ i, θ i ) = 0 if θ i < y i1, and it assigns the object to the bidder with the highest payoff type. The associated payment rule is given by: t i (θ i, θ i ) = y i1 + α K k=1 y ik if θ i > y i1, 0 if θ i < y i1. In the case of a tie, the license is randomly assigned among the competing bidders. With this specification, bidders valuations remain positively interdependent and the decisions to acquire information will be shown to be strategic substitutes. Yet the equilibrium of the information game may feature socially insufficient information acquisition. Now consider the bidders private incentive to acquire information. As before, let i = 1,..., m denote the first m bidders who acquire information and let i = m + 1,..., I denote the remaining bidders who stay uninformed. Since a bidder can gain only by becoming informed and winning the object, the m-th bidder s expected individual gain from information acquisition is simply E θ [(u m (θ) t m (θ)) 1 {θ m y m1 }]. (19) The next proposition shows that the private gain of the m-th bidder from acquiring information is decreasing in m. That is, when more bidders get informed, bidder i has a lower incentive to acquire information and hence the information decisions remain strategic substitutes. Proposition 8 (Strategic Substitute) The private value of information m is decreasing in m for K < m < I. We now consider the information decision from the social perspective. The social gain from the m-th bidder acquiring information is given by: [ K ( ) { } ] E (θ m y m1 ) 1 {θ m y m1 } + α θm y m(k+1) 1 ymk θ m < y m(k 1). (20) k=1

Information Acquisition in Interdependent Value Auctions

Information Acquisition in Interdependent Value Auctions Information Acquisition in Interdependent Value Auctions Dirk Bergemann Xianwen Shi Juuso Välimäki July 16, 2008 Abstract We consider an auction environment with interdependent values. Each bidder can

More information

Mechanism Design: Basic Concepts

Mechanism Design: Basic Concepts Advanced Microeconomic Theory: Economics 521b Spring 2011 Juuso Välimäki Mechanism Design: Basic Concepts The setup is similar to that of a Bayesian game. The ingredients are: 1. Set of players, i {1,

More information

Lecture 4. 1 Examples of Mechanism Design Problems

Lecture 4. 1 Examples of Mechanism Design Problems CSCI699: Topics in Learning and Game Theory Lecture 4 Lecturer: Shaddin Dughmi Scribes: Haifeng Xu,Reem Alfayez 1 Examples of Mechanism Design Problems Example 1: Single Item Auctions. There is a single

More information

CPS 173 Mechanism design. Vincent Conitzer

CPS 173 Mechanism design. Vincent Conitzer CPS 173 Mechanism design Vincent Conitzer conitzer@cs.duke.edu edu Mechanism design: setting The center has a set of outcomes O that she can choose from Allocations of tasks/resources, joint plans, Each

More information

Robust Mechanism Design and Robust Implementation

Robust Mechanism Design and Robust Implementation Robust Mechanism Design and Robust Implementation joint work with Stephen Morris August 2009 Barcelona Introduction mechanism design and implementation literatures are theoretical successes mechanisms

More information

The Revenue Equivalence Theorem 1

The Revenue Equivalence Theorem 1 John Nachbar Washington University May 2, 2017 The Revenue Equivalence Theorem 1 1 Introduction. The Revenue Equivalence Theorem gives conditions under which some very different auctions generate the same

More information

Sequential Bidding in the Bailey-Cavallo Mechanism

Sequential Bidding in the Bailey-Cavallo Mechanism Sequential Bidding in the Bailey-Cavallo Mechanism Krzysztof R. Apt 1,2 and Evangelos Markakis 2 1 CWI, Science Park 123, 1098 XG Amsterdam 2 Institute of Logic, Language and Computation, University of

More information

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

Mechanism Design. Terence Johnson. December 7, University of Notre Dame. Terence Johnson (ND) Mechanism Design December 7, / 44 Mechanism Design Terence Johnson University of Notre Dame December 7, 2017 Terence Johnson (ND) Mechanism Design December 7, 2017 1 / 44 Market Design vs Mechanism Design In Market Design, we have a very

More information

ROBUST IMPLEMENTATION: THE CASE OF DIRECT MECHANISMS. Dirk Bergemann and Stephen Morris. March 2006 COWLES FOUNDATION DISCUSSION PAPER NO.

ROBUST IMPLEMENTATION: THE CASE OF DIRECT MECHANISMS. Dirk Bergemann and Stephen Morris. March 2006 COWLES FOUNDATION DISCUSSION PAPER NO. ROBUST IMPLEMENTATION: THE CASE OF DIRECT MECHANISMS By Dirk Bergemann and Stephen Morris March 2006 COWLES FOUNDATION DISCUSSION PAPER NO. 1561 COWLES FOUNDATION FOR RESEARCH IN ECONOMICS YALE UNIVERSITY

More information

Game Theory: Spring 2017

Game Theory: Spring 2017 Game Theory: Spring 2017 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss 1 Plan for Today In this second lecture on mechanism design we are going to generalise

More information

WHEN ARE SIGNALS COMPLEMENTS OR SUBSTITUTES?

WHEN ARE SIGNALS COMPLEMENTS OR SUBSTITUTES? Working Paper 07-25 Departamento de Economía Economic Series 15 Universidad Carlos III de Madrid March 2007 Calle Madrid, 126 28903 Getafe (Spain) Fax (34-91) 6249875 WHEN ARE SIGNALS COMPLEMENTS OR SUBSTITUTES?

More information

Non-Existence of Equilibrium in Vickrey, Second-Price, and English Auctions

Non-Existence of Equilibrium in Vickrey, Second-Price, and English Auctions Non-Existence of Equilibrium in Vickrey, Second-Price, and English Auctions Matthew O. Jackson September 21, 2005 Forthcoming: Review of Economic Design Abstract A simple example shows that equilibria

More information

Mechanism Design: Bayesian Incentive Compatibility

Mechanism Design: Bayesian Incentive Compatibility May 30, 2013 Setup X : finite set of public alternatives X = {x 1,..., x K } Θ i : the set of possible types for player i, F i is the marginal distribution of θ i. We assume types are independently distributed.

More information

Second Price Auctions with Differentiated Participation Costs

Second Price Auctions with Differentiated Participation Costs Second Price Auctions with Differentiated Participation Costs Xiaoyong Cao Department of Economics Texas A&M University College Station, TX 77843 Guoqiang Tian Department of Economics Texas A&M University

More information

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

Microeconomics II Lecture 4: Incomplete Information Karl Wärneryd Stockholm School of Economics November 2016 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,

More information

Vickrey-Clarke-Groves Mechanisms

Vickrey-Clarke-Groves Mechanisms Vickrey-Clarke-Groves Mechanisms Jonathan Levin 1 Economics 285 Market Design Winter 2009 1 These slides are based on Paul Milgrom s. onathan Levin VCG Mechanisms Winter 2009 1 / 23 Motivation We consider

More information

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

Vickrey Auction. Mechanism Design. Algorithmic Game Theory. Alexander Skopalik Algorithmic Game Theory 2013 Mechanism Design Algorithmic Game Theory Vickrey Auction Vickrey-Clarke-Groves Mechanisms Mechanisms with Money Player preferences are quantifiable. Common currency enables utility transfer between players. Preference

More information

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

Mechanism Design II. Terence Johnson. University of Notre Dame. Terence Johnson (ND) Mechanism Design II 1 / 30 Mechanism Design II Terence Johnson University of Notre Dame Terence Johnson (ND) Mechanism Design II 1 / 30 Mechanism Design Recall: game theory takes the players/actions/payoffs as given, and makes predictions

More information

Algorithmic Game Theory and Applications

Algorithmic Game Theory and Applications Algorithmic Game Theory and Applications Lecture 18: Auctions and Mechanism Design II: a little social choice theory, the VCG Mechanism, and Market Equilibria Kousha Etessami Reminder: Food for Thought:

More information

Deceptive Advertising with Rational Buyers

Deceptive Advertising with Rational Buyers Deceptive Advertising with Rational Buyers September 6, 016 ONLINE APPENDIX In this Appendix we present in full additional results and extensions which are only mentioned in the paper. In the exposition

More information

Full Surplus Extraction and Costless Information Revelation in Dynamic Environments. Shunya NODA (University of Tokyo)

Full Surplus Extraction and Costless Information Revelation in Dynamic Environments. Shunya NODA (University of Tokyo) Full Surplus Extraction and Costless Information Revelation in Dynamic Environments Shunya NODA (University of Tokyo) Outline 1. Introduction. Two-Period Example 3. Three-Period Example 4. Model 5. Main

More information

Bayesian Games and Mechanism Design Definition of Bayes Equilibrium

Bayesian Games and Mechanism Design Definition of Bayes Equilibrium Bayesian Games and Mechanism Design Definition of Bayes Equilibrium Harsanyi [1967] What happens when players do not know one another s payoffs? Games of incomplete information versus games of imperfect

More information

Informed Principal in Private-Value Environments

Informed Principal in Private-Value Environments Informed Principal in Private-Value Environments Tymofiy Mylovanov Thomas Tröger University of Bonn June 21, 2008 1/28 Motivation 2/28 Motivation In most applications of mechanism design, the proposer

More information

Redistribution Mechanisms for Assignment of Heterogeneous Objects

Redistribution Mechanisms for Assignment of Heterogeneous Objects Redistribution Mechanisms for Assignment of Heterogeneous Objects Sujit Gujar Dept of Computer Science and Automation Indian Institute of Science Bangalore, India sujit@csa.iisc.ernet.in Y Narahari Dept

More information

Robust Predictions in Games with Incomplete Information

Robust Predictions in Games with Incomplete Information Robust Predictions in Games with Incomplete Information joint with Stephen Morris (Princeton University) November 2010 Payoff Environment in games with incomplete information, the agents are uncertain

More information

Auctions with Dynamic Populations: Efficiency and Revenue Maximization

Auctions with Dynamic Populations: Efficiency and Revenue Maximization MPRA Munich Personal RePEc Archive Auctions with Dynamic Populations: Efficiency and Revenue Maximization Maher Said Yale University 27. April 2009 Online at http://mpra.ub.uni-muenchen.de/14988/ MPRA

More information

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

Vickrey Auction VCG Characterization. Mechanism Design. Algorithmic Game Theory. Alexander Skopalik Algorithmic Game Theory 2013 Mechanism Design Algorithmic Game Theory Vickrey Auction Vickrey-Clarke-Groves Mechanisms Characterization of IC Mechanisms Mechanisms with Money Player preferences are quantifiable. Common currency enables utility transfer

More information

Dynamic Common Agency

Dynamic Common Agency Dynamic Common Agency Dirk Bergemann Juuso Välimäki January 2001 Abstract A general model of dynamic common agency with symmetric information is considered. The set of truthful Markov perfect equilibrium

More information

Lecture 10: Mechanism Design

Lecture 10: Mechanism Design Computational Game Theory Spring Semester, 2009/10 Lecture 10: Mechanism Design Lecturer: Yishay Mansour Scribe: Vera Vsevolozhsky, Nadav Wexler 10.1 Mechanisms with money 10.1.1 Introduction As we have

More information

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

Microeconomic Theory (501b) Problem Set 10. Auctions and Moral Hazard Suggested Solution: Tibor Heumann Dirk Bergemann Department of Economics Yale University Microeconomic Theory (50b) Problem Set 0. Auctions and Moral Hazard Suggested Solution: Tibor Heumann 4/5/4 This problem set is due on Tuesday, 4//4..

More information

Information Acquisition and Efficient Mechanism Design

Information Acquisition and Efficient Mechanism Design Information Acquisition and Efficient Mechanism Design Dirk Bergemann Juuso Välimäki First version: May 1999 This Version: May 2001 Abstract We consider a general mechanism design setting where each agent

More information

Mechanism Design with Endogenous Information Acquisition, Endogenous Status and Endogenous Quantities

Mechanism Design with Endogenous Information Acquisition, Endogenous Status and Endogenous Quantities Abstract Mechanism Design with Endogenous Information Acquisition, Endogenous Status and Endogenous Quantities Xianwen Shi 27 In the first chapter, I study optimal auction design in a private value setting

More information

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

Theory of Auctions. Carlos Hurtado. Jun 23th, Department of Economics University of Illinois at Urbana-Champaign Theory of Auctions Carlos Hurtado Department of Economics University of Illinois at Urbana-Champaign hrtdmrt2@illinois.edu Jun 23th, 2015 C. Hurtado (UIUC - Economics) Game Theory On the Agenda 1 Formalizing

More information

CS 573: Algorithmic Game Theory Lecture date: April 11, 2008

CS 573: Algorithmic Game Theory Lecture date: April 11, 2008 CS 573: Algorithmic Game Theory Lecture date: April 11, 2008 Instructor: Chandra Chekuri Scribe: Hannaneh Hajishirzi Contents 1 Sponsored Search Auctions 1 1.1 VCG Mechanism......................................

More information

FIRST PRICE AUCTIONS WITH GENERAL INFORMATION STRUCTURES: IMPLICATIONS FOR BIDDING AND REVENUE. Dirk Bergemann, Benjamin Brooks, and Stephen Morris

FIRST PRICE AUCTIONS WITH GENERAL INFORMATION STRUCTURES: IMPLICATIONS FOR BIDDING AND REVENUE. Dirk Bergemann, Benjamin Brooks, and Stephen Morris FIRST PRICE AUCTIONS WITH GENERAL INFORMATION STRUCTURES: IMPLICATIONS FOR BIDDING AND REVENUE By Dirk Bergemann, Benjamin Brooks, and Stephen Morris August 2015 Revised November 2015 COWLES FOUNDATION

More information

Information Acquisition and Efficient Mechanism Design

Information Acquisition and Efficient Mechanism Design Information Acquisition and Efficient Mechanism Design Dirk Bergemann Juuso Välimäki First Version: May 1999 This Version: November 2000 Abstract We consider a general mechanism design setting where each

More information

Definitions and Proofs

Definitions and Proofs Giving Advice vs. Making Decisions: Transparency, Information, and Delegation Online Appendix A Definitions and Proofs A. The Informational Environment The set of states of nature is denoted by = [, ],

More information

Strategies under Strategic Uncertainty

Strategies under Strategic Uncertainty Discussion Paper No. 18-055 Strategies under Strategic Uncertainty Helene Mass Discussion Paper No. 18-055 Strategies under Strategic Uncertainty Helene Mass Download this ZEW Discussion Paper from our

More information

First-Price Auctions with General Information Structures: Implications for Bidding and Revenue

First-Price Auctions with General Information Structures: Implications for Bidding and Revenue First-Price Auctions with General Information Structures: Implications for Bidding and Revenue Dirk Bergemann Benjamin Brooks Stephen Morris May 6, 2016 Abstract We explore the impact of private information

More information

Appendix of Homophily in Peer Groups The Costly Information Case

Appendix of Homophily in Peer Groups The Costly Information Case Appendix of Homophily in Peer Groups The Costly Information Case Mariagiovanna Baccara Leeat Yariv August 19, 2012 1 Introduction In this Appendix we study the information sharing application analyzed

More information

Mechanism Design. Christoph Schottmüller / 27

Mechanism Design. Christoph Schottmüller / 27 Mechanism Design Christoph Schottmüller 2015-02-25 1 / 27 Outline 1 Bayesian implementation and revelation principle 2 Expected externality mechanism 3 Review questions and exercises 2 / 27 Bayesian implementation

More information

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

Game Theory. Monika Köppl-Turyna. Winter 2017/2018. Institute for Analytical Economics Vienna University of Economics and Business Monika Köppl-Turyna Institute for Analytical Economics Vienna University of Economics and Business Winter 2017/2018 Static Games of Incomplete Information Introduction So far we assumed that payoff functions

More information

Mechanism Design: Dominant Strategies

Mechanism Design: Dominant Strategies May 20, 2014 Some Motivation Previously we considered the problem of matching workers with firms We considered some different institutions for tackling the incentive problem arising from asymmetric information

More information

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

Working Paper EQUILIBRIUM SELECTION IN COMMON-VALUE SECOND-PRICE AUCTIONS. Heng Liu Working Paper EQUILIBRIUM SELECTION IN COMMON-VALUE SECOND-PRICE AUCTIONS Heng Liu This note considers equilibrium selection in common-value secondprice auctions with two bidders. We show that for each

More information

Revenue Guarantee Equivalence

Revenue Guarantee Equivalence Revenue Guarantee Equivalence Dirk Bergemann Benjamin Brooks Stephen Morris November 7, 2018 Abstract We revisit the revenue comparison of standard auction formats, including first-price, second-price,

More information

Online Appendix for Dynamic Ex Post Equilibrium, Welfare, and Optimal Trading Frequency in Double Auctions

Online Appendix for Dynamic Ex Post Equilibrium, Welfare, and Optimal Trading Frequency in Double Auctions Online Appendix for Dynamic Ex Post Equilibrium, Welfare, and Optimal Trading Frequency in Double Auctions Songzi Du Haoxiang Zhu September 2013 This document supplements Du and Zhu (2013. All results

More information

Introduction to Mechanism Design

Introduction to Mechanism Design Introduction to Mechanism Design Xianwen Shi University of Toronto Minischool on Variational Problems in Economics September 2014 Introduction to Mechanism Design September 2014 1 / 75 Mechanism Design

More information

A Rothschild-Stiglitz approach to Bayesian persuasion

A Rothschild-Stiglitz approach to Bayesian persuasion A Rothschild-Stiglitz approach to Bayesian persuasion Matthew Gentzkow and Emir Kamenica Stanford University and University of Chicago September 2015 Abstract Rothschild and Stiglitz (1970) introduce a

More information

Economics and Computation

Economics and Computation Economics and Computation ECON 425/563 and CPSC 455/555 Professor Dirk Bergemann and Professor Joan Feigenbaum Combinatorial Auctions In case of any questions and/or remarks on these lecture notes, please

More information

Notes on Mechanism Designy

Notes on Mechanism Designy Notes on Mechanism Designy ECON 20B - Game Theory Guillermo Ordoñez UCLA February 0, 2006 Mechanism Design. Informal discussion. Mechanisms are particular types of games of incomplete (or asymmetric) information

More information

Cowles Foundation for Research in Economics at Yale University

Cowles Foundation for Research in Economics at Yale University Cowles Foundation for Research in Economics at Yale University Cowles Foundation Discussion Paper No. 1846 EFFICIENT AUCTIONS AND INTERDEPENDENT TYPES Dirk Bergemann, Stephen Morris, and Satoru Takahashi

More information

Epsilon Ex Post Implementation

Epsilon Ex Post Implementation Epsilon Ex Post Implementation Mehmet Barlo Nuh Aygun Dalkiran February 10, 2014 Abstract We provide necessary and sufficient conditions for epsilon ex post implementation. Our analysis extends Bergemann

More information

APPLIED MECHANISM DESIGN FOR SOCIAL GOOD

APPLIED MECHANISM DESIGN FOR SOCIAL GOOD APPLIED MECHANISM DESIGN FOR SOCIAL GOOD JOHN P DICKERSON Lecture #3 09/06/2016 CMSC828M Tuesdays & Thursdays 12:30pm 1:45pm REMINDER: SEND ME TOP 3 PRESENTATION PREFERENCES! I LL POST THE SCHEDULE TODAY

More information

Lecture Slides - Part 4

Lecture Slides - Part 4 Lecture Slides - Part 4 Bengt Holmstrom MIT February 2, 2016. Bengt Holmstrom (MIT) Lecture Slides - Part 4 February 2, 2016. 1 / 65 Mechanism Design n agents i = 1,..., n agent i has type θ i Θ i which

More information

Public Provision of Scarce Resources when Preferences are Non-Linear

Public Provision of Scarce Resources when Preferences are Non-Linear Public Provision of Scarce Resources when Preferences are Non-Linear Katharina Huesmann February 13, 2017 Abstract This paper considers the problem of assigning an indivisible good of limited availability

More information

Optimal Auctions with Information Acquisition

Optimal Auctions with Information Acquisition Optimal Auctions with Information Acquisition Xianwen Shi Current Version: May 2011 Abstract This paper studies optimal auction design in a private value setting with endogenous information gathering.

More information

Multidimensional Private Value Auctions

Multidimensional Private Value Auctions Multidimensional Private Value Auctions Hanming Fang Stephen Morris First Draft: May 2002 This Draft: February 2004 Abstract We consider parametric examples of symmetric two-bidder private value auctions

More information

Mechanism Design: Review of Basic Concepts

Mechanism Design: Review of Basic Concepts Juuso Välimäki Oslo Minicourse in Mechanism Design November 206 Mechanism Design: Review of Basic Concepts Single Agent We start with a review of incentive compatibility in the simplest possible setting:

More information

A technical appendix for multihoming and compatibility

A technical appendix for multihoming and compatibility A technical appendix for multihoming and compatibility Toker Doganoglu and Julian Wright July 19, 2005 We would like to thank two anonymous referees and our editor, Simon Anderson, for their very helpful

More information

On the Impossibility of Black-Box Truthfulness Without Priors

On the Impossibility of Black-Box Truthfulness Without Priors On the Impossibility of Black-Box Truthfulness Without Priors Nicole Immorlica Brendan Lucier Abstract We consider the problem of converting an arbitrary approximation algorithm for a singleparameter social

More information

Sealed-bid first-price auctions with an unknown number of bidders

Sealed-bid first-price auctions with an unknown number of bidders Sealed-bid first-price auctions with an unknown number of bidders Erik Ekström Department of Mathematics, Uppsala University Carl Lindberg The Second Swedish National Pension Fund e-mail: ekstrom@math.uu.se,

More information

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

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012 Game Theory Lecture Notes By Y. Narahari Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012 The Vickrey-Clarke-Groves Mechanisms Note: This is a only a

More information

A Review of Auction Theory: Sequential Auctions and Vickrey Auctions

A Review of Auction Theory: Sequential Auctions and Vickrey Auctions A Review of Auction Theory: and Vickrey Daniel R. 1 1 Department of Economics University of Maryland, College Park. September 2017 / Econ415 . Vickrey s. Vickrey. Example Two goods, one per bidder Suppose

More information

On the Pareto Efficiency of a Socially Optimal Mechanism for Monopoly Regulation

On the Pareto Efficiency of a Socially Optimal Mechanism for Monopoly Regulation MPRA Munich Personal RePEc Archive On the Pareto Efficiency of a Socially Optimal Mechanism for Monopoly Regulation Ismail Saglam Ipek University 4 May 2016 Online at https://mpra.ub.uni-muenchen.de/71090/

More information

Mechanisms with Referrals: VCG Mechanisms and Multi-Level Mechanisms

Mechanisms with Referrals: VCG Mechanisms and Multi-Level Mechanisms Mechanisms with Referrals: VCG Mechanisms and Multi-Level Mechanisms Joosung Lee February 2016 Abstract We study mechanisms for asymmetric information on networks with the following features: 1) A mechanism

More information

THEORIES ON AUCTIONS WITH PARTICIPATION COSTS. A Dissertation XIAOYONG CAO

THEORIES ON AUCTIONS WITH PARTICIPATION COSTS. A Dissertation XIAOYONG CAO THEORIES ON AUCTIONS WITH PARTICIPATION COSTS A Dissertation by XIAOYONG CAO Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree

More information

Lectures on Robust Mechanism Design at BU

Lectures on Robust Mechanism Design at BU Lectures on at BU Stephen Morris January 2009 Introduction I Mechanism Design and Implementation literatures are theoretical successes I mechanisms seem to complicated to use in practise... I successful

More information

Second-Price Auctions with Different Participation Costs

Second-Price Auctions with Different Participation Costs Second-Price Auctions with Different Participation Costs Xiaoyong Cao Department of Economics University of International Business and Economics Beijing, China, 100029 Guoqiang Tian Department of Economics

More information

Interdependent Value Auctions with an Insider Bidder 1

Interdependent Value Auctions with an Insider Bidder 1 Interdependent Value Auctions with an Insider Bidder Jinwoo Kim We study the efficiency of standard auctions with interdependent values in which one of two bidders is perfectly informed of his value while

More information

CS364B: Frontiers in Mechanism Design Lecture #2: Unit-Demand Bidders and Walrasian Equilibria

CS364B: Frontiers in Mechanism Design Lecture #2: Unit-Demand Bidders and Walrasian Equilibria CS364B: Frontiers in Mechanism Design Lecture #2: Unit-Demand Bidders and Walrasian Equilibria Tim Roughgarden January 8, 2014 1 Bidders with Unit-Demand Valuations 1.1 The Setting Last lecture we discussed

More information

Robust Implementation: The Case of Direct Mechanisms

Robust Implementation: The Case of Direct Mechanisms Robust Implementation: The Case of Direct Mechanisms Dirk Bergemann y Stephen Morris z First Version: August 25 This Version: February 26 Abstract A social choice function is robustly implementable if

More information

Static Information Design

Static Information Design Static Information Design Dirk Bergemann and Stephen Morris Frontiers of Economic Theory & Computer Science, Becker-Friedman Institute, August 2016 Mechanism Design and Information Design Basic Mechanism

More information

Ex post renegotiation-proof mechanism design

Ex post renegotiation-proof mechanism design Ex post renegotiation-proof mechanism design Zvika Neeman Gregory Pavlov February 4, 2012 Abstract We study a mechanism design problem under the assumption that ex post renegotiation cannot be prevented.

More information

EC476 Contracts and Organizations, Part III: Lecture 2

EC476 Contracts and Organizations, Part III: Lecture 2 EC476 Contracts and Organizations, Part III: Lecture 2 Leonardo Felli 32L.G.06 19 January 2015 Moral Hazard: Consider the contractual relationship between two agents (a principal and an agent) The principal

More information

MIT Sloan School of Management

MIT Sloan School of Management MIT Sloan School of Management Working Paper 4249-02 July 2002 BIDDING LOWER WITH HIGHER VALUES IN MULTI-OBJECT AUCTIONS David McAdams 2002 by David McAdams. All rights reserved. Short sections of text,

More information

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

Motivation. Game Theory 24. Mechanism Design. Setting. Preference relations contain no information about by how much one candidate is preferred. Motivation Game Theory 24. Mechanism Design Preference relations contain no information about by how much one candidate is preferred. Idea: Use money to measure this. Albert-Ludwigs-Universität Freiburg

More information

A Rothschild-Stiglitz approach to Bayesian persuasion

A Rothschild-Stiglitz approach to Bayesian persuasion A Rothschild-Stiglitz approach to Bayesian persuasion Matthew Gentzkow and Emir Kamenica Stanford University and University of Chicago December 2015 Abstract Rothschild and Stiglitz (1970) represent random

More information

Strongly rational expectations equilibria with endogenous acquisition of information

Strongly rational expectations equilibria with endogenous acquisition of information Strongly rational expectations equilibria with endogenous acquisition of information Gabriel Desgranges Maik Heinemann 9 February 004 This paper analyzes conditions for existence of a strongly rational

More information

Optimal Auctions with Correlated Bidders are Easy

Optimal Auctions with Correlated Bidders are Easy Optimal Auctions with Correlated Bidders are Easy Shahar Dobzinski Department of Computer Science Cornell Unversity shahar@cs.cornell.edu Robert Kleinberg Department of Computer Science Cornell Unversity

More information

Multidimensional private value auctions

Multidimensional private value auctions Journal of Economic Theory 126 (2006) 1 30 www.elsevier.com/locate/jet Multidimensional private value auctions Hanming Fang a, Stephen Morris b, a Department of Economics, Yale University, P.O. Box 208264,

More information

First Price Auctions with General Information Structures: Implications for Bidding and Revenue

First Price Auctions with General Information Structures: Implications for Bidding and Revenue First Price Auctions with General Information Structures: Implications for Bidding and Revenue Dirk Bergemann Benjamin Brooks Stephen Morris August 10, 2015 Abstract This paper explores the consequences

More information

DYNAMIC MECHANISM DESIGN: AN INTRODUCTION. August 2017 COWLES FOUNDATION DISCUSSION PAPER NO. 2102

DYNAMIC MECHANISM DESIGN: AN INTRODUCTION. August 2017 COWLES FOUNDATION DISCUSSION PAPER NO. 2102 DYNAMIC MECHANISM DESIGN: AN INTRODUCTION By Dirk Bergemann and Juuso Välimäki August 2017 COWLES FOUNDATION DISCUSSION PAPER NO. 2102 COWLES FOUNDATION FOR RESEARCH IN ECONOMICS YALE UNIVERSITY Box 208281

More information

Game theory lecture 4. September 24, 2012

Game theory lecture 4. September 24, 2012 September 24, 2012 Finding Nash equilibrium Best-response or best-reply functions. We introduced Nash-equilibrium as a profile of actions (an action for each player) such that no player has an incentive

More information

On Random Sampling Auctions for Digital Goods

On Random Sampling Auctions for Digital Goods On Random Sampling Auctions for Digital Goods Saeed Alaei Azarakhsh Malekian Aravind Srinivasan Saeed Alaei, Azarakhsh Malekian, Aravind Srinivasan Random Sampling Auctions... 1 Outline Background 1 Background

More information

Algorithmic Game Theory Introduction to Mechanism Design

Algorithmic Game Theory Introduction to Mechanism Design Algorithmic Game Theory Introduction to Mechanism Design Makis Arsenis National Technical University of Athens April 216 Makis Arsenis (NTUA) AGT April 216 1 / 41 Outline 1 Social Choice Social Choice

More information

On the Unique D1 Equilibrium in the Stackelberg Model with Asymmetric Information Janssen, M.C.W.; Maasland, E.

On the Unique D1 Equilibrium in the Stackelberg Model with Asymmetric Information Janssen, M.C.W.; Maasland, E. Tilburg University On the Unique D1 Equilibrium in the Stackelberg Model with Asymmetric Information Janssen, M.C.W.; Maasland, E. Publication date: 1997 Link to publication General rights Copyright and

More information

Multi-object auctions (and matching with money)

Multi-object auctions (and matching with money) (and matching with money) Introduction Many auctions have to assign multiple heterogenous objects among a group of heterogenous buyers Examples: Electricity auctions (HS C 18:00), auctions of government

More information

A Strict Ex-post Incentive Compatible Mechanism for Interdependent Valuations

A Strict Ex-post Incentive Compatible Mechanism for Interdependent Valuations A Strict Ex-post Incentive Compatible Mechanism for Interdependent Valuations Swaprava Nath a, Onno Zoeter b a Indian Institute of Science, Bangalore b Xerox Research Centre Europe, Meylan, France Abstract

More information

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

Robert Wilson (1977), A Bidding Model of Perfect Competition, Review of Economic Econ 805 Advanced Micro Theory I Dan Quint Fall 2008 Lecture 10 Oct 7 2008 No lecture on Thursday New HW, and solutions to last one, online Today s papers: Robert Wilson (1977), A Bidding Model of Perfect

More information

Design Patent Damages under Sequential Innovation

Design Patent Damages under Sequential Innovation Design Patent Damages under Sequential Innovation Yongmin Chen and David Sappington University of Colorado and University of Florida February 2016 1 / 32 1. Introduction Patent policy: patent protection

More information

Economics 3012 Strategic Behavior Andy McLennan October 20, 2006

Economics 3012 Strategic Behavior Andy McLennan October 20, 2006 Economics 301 Strategic Behavior Andy McLennan October 0, 006 Lecture 11 Topics Problem Set 9 Extensive Games of Imperfect Information An Example General Description Strategies and Nash Equilibrium Beliefs

More information

Lecture 6: Communication Complexity of Auctions

Lecture 6: Communication Complexity of Auctions Algorithmic Game Theory October 13, 2008 Lecture 6: Communication Complexity of Auctions Lecturer: Sébastien Lahaie Scribe: Rajat Dixit, Sébastien Lahaie In this lecture we examine the amount of communication

More information

1 Games in Normal Form (Strategic Form)

1 Games in Normal Form (Strategic Form) Games in Normal Form (Strategic Form) A Game in Normal (strategic) Form consists of three components. A set of players. For each player, a set of strategies (called actions in textbook). The interpretation

More information

Introduction to Game Theory

Introduction to Game Theory Introduction to Game Theory Part 3. Static games of incomplete information Chapter 2. Applications Ciclo Profissional 2 o Semestre / 2011 Graduação em Ciências Econômicas V. Filipe Martins-da-Rocha (FGV)

More information

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

Solution: Since the prices are decreasing, we consider all the nested options {1,..., i}. Given such a set, the expected revenue is. Problem 1: Choice models and assortment optimization Consider a MNL choice model over five products with prices (p1,..., p5) = (7, 6, 4, 3, 2) and preference weights (i.e., MNL parameters) (v1,..., v5)

More information

Position Auctions with Interdependent Values

Position Auctions with Interdependent Values Position Auctions with Interdependent Values Haomin Yan August 5, 217 Abstract This paper extends the study of position auctions to an interdependent values model in which each bidder s value depends on

More information

DYNAMIC MECHANISM DESIGN: AN INTRODUCTION. Dirk Bergemann and Juuso Välimäki. August 2017 Revised June 2018

DYNAMIC MECHANISM DESIGN: AN INTRODUCTION. Dirk Bergemann and Juuso Välimäki. August 2017 Revised June 2018 DYNAMIC MECHANISM DESIGN: AN INTRODUCTION By Dirk Bergemann and Juuso Välimäki August 2017 Revised June 2018 COWLES FOUNDATION DISCUSSION PAPER NO. 2102R COWLES FOUNDATION FOR RESEARCH IN ECONOMICS YALE

More information

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

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012 Game Theory Lecture Notes By Y. Narahari Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012 Myerson Optimal Auction Note: This is a only a draft version,

More information

EconS Microeconomic Theory II Homework #9 - Answer key

EconS Microeconomic Theory II Homework #9 - Answer key EconS 503 - Microeconomic Theory II Homework #9 - Answer key 1. WEAs with market power. Consider an exchange economy with two consumers, A and B, whose utility functions are u A (x A 1 ; x A 2 ) = x A

More information

Introduction. 1 University of Pennsylvania, Wharton Finance Department, Steinberg Hall-Dietrich Hall, 3620

Introduction. 1 University of Pennsylvania, Wharton Finance Department, Steinberg Hall-Dietrich Hall, 3620 May 16, 2006 Philip Bond 1 Are cheap talk and hard evidence both needed in the courtroom? Abstract: In a recent paper, Bull and Watson (2004) present a formal model of verifiability in which cheap messages

More information