Information Acquisition in Auctions
by
Nicola Persico
Citation
Title:
Information Acquisition in Auctions
Author:
Nicola Persico
Year:
2000
Publication:
Econometrica
Volume:
68
Issue:
1
Start Page:
135
End Page:
148
Publisher:
Language:
English
URL:
Select license:
Select License
DOI:
PMID:
ISSN:
Updated: November 14th, 2012
Abstract:
NOTES AND COMMENTS
INFORMATION ACQUISITION IN AUCTIONS
1. INTRODUCTION
OURAIM IN THIS PAPER is to study the incentives to acquire information. We consider decision problems where the payoff has the singlecrossing property and signals are affiliated with the unknown parameter. We introduce the llotioll of risksensiticity, and establish that the value of information is higher in decision problems that are more risksensitive. We apply this result to auctions: we are able to show that a first price auction induces more information acquisition than a second price auction.
Consider a decision maker choosing an action a to maximize the expected value of a payoff function u(i:, a). The decision maker does not observe c, which he regards as a random variable V. Instead, he observes the realization of a random variable X, a signal which conveys informatioll about r.. We assume that the decision maker can make X more informative, at a cost. Making X more informative increases the expected payoff. We analyze the returns to making X more informative.
We focus on problems where X and V are affiliated; and u(c,a) has the weak singlecrossing property in (a; c) in the definition of Milgrom and Shannon (1994). See Figure 1 for examples of singlecrossing payoff fullctiolls u,(c, a) and ~r,,(c, a).
For these problems we are able to identify a determinant of the value of information. To this end, we introduce the notion of "risksensitivity." Let aYd denote the a that maximizes u(c>,a) for given L'. We define a payoff to be more risksensitive than another if, for given c, it decreases more sharply as a moves away from a"'(c~).See Figure 1, where u, is more risksensitive than u,,.' We show that the more risksensitive a payoff function, the larger the increase in expected revenue from adopting a more accurate signal. Intuitively, informatioll is more valuable in problem I since inferring the wrong value for c, and hence taking a suboptimal action a f a"(c), results in a larger loss of utility than in problem II. We exploit this property in Theorem 2 to determine which decision problems induce more information acquisition.
We then apply this result to auctions. Suppose that, before an auction, bidders could acquire information about the value V of the object for sale. Would they choose to acquire more informatioll before a first or a second price auction? The answer is: before a first price auction. Indeed, we show that the payoff in a first price auction is more risksensitive than in a second price, as in Figure 1. The intuition for why the value of information is higher in a first price auction is as follows. The value of the object V is informative about the opponent's bid, because the opponent's signal is positively corre lated with V. When bidder 1 acquires informatioll about V, his signal becomes "more
I am grateful to S. Athey, I. Jewitt, M. Krishnan, W. Pesendorfer. A. Postlewaite, J. Valimaki, A. Wolinsb, and especially Steve Matthews. The editor and four anonymous referees made invaluable suggestions. A Sloan Dissertation Fellowship is gratefully acknowledged.
'Despite the appearance of Figure 1, quasiconcavity of LL(L.,a) in n is not necessary for our arguments.
FIGURE1.The function u,is mole risksensitive than i~,,. Here L ' < i " < r "'
correlated" with V and bidder 1 ends up bidding closerin a statistical senseto bidder
2. Now consider the two mechanisms: in a second price auction the price paid does not depend on the winner's bid; hence, there is no incentive to bid close to the opponent, conditional on winning or losing. The payoff is not very risksensitive. However, in a first price auction there is a clear incentive to bid close to the opponent: the winner in a first price auction could save money by bidding just above the second highest bidder. The payoff is very risksensitive. As a result, correlation with the opponent's bid is more valuable in a first price auction. Since information about the object provides correlation with the opponent's bid, the result follows.
The paper proceeds as follows. Section 2 analyzes decision problems. First, the model and the assumptions are presented. Section 2.3 introduces accuracy, a somewhat novel definition of informativeness of signals. This notion is more general than Blackw~ell's sufficiency for the kind of decision problems we consider. Section 2.4 presents the result on the marginal revenue of information. Section 3 applies this result to auctions. The model is introduced in Section 3.1, and in Section 3.2 first and second price auctions are compared. Section 4 discusses related literature and concludes.
2. AFFILIATED DECISION PROBLEMS
2.1. The Decision Problem
A payoff function is a function
u(c,a):TXd+ R.
The real number L' E 9' is an unknown parameter, seen as the realization of a random variable V.Let g(c) be the prior density for V, with c.d.f. G(L~).
The real number a ~dis the action that the decision maker takes.
from a family of signals {Xq}, ,
,,
where E is an interval of the real line. Xv is a random
variable with conditional density fv(xl~')and c.d.f. Fv(xlc). Denote the support of Xq by F,and let 2:=U, .P.
We use the term statistical structure to denote a prior G(L') together with a family of signals. A payoff function together with a signal Xq and a prior G(c)give rise to the decision problem
where Gq(~'Ix)
denotes the density for V conditional on observing Xq =x.
Let av(x)be an optimal action upon observing Xq =x,
arl(x)E argmax,, ,u(c,a) dGv(clx).
17
Let
denote the expected payoff of a decision maker endowed with signal XT. A decision maker choosing his signal XT from {Xq}?,,will balance R(n) with the cost C(7)of acquiring that signal. We call the optimization problem
an information acquisitionproblem. In the case where R(T) is differentiable, let
denote the marginal revenue to the decision maker from illcreasing 77.
We restrict attention to the class of payoffs that have the singlecrossing property in (a; c) (see Athey (19971, Milgrom and Shannon (1994), and Figure 1 for pictures of singlecrossing functions). The next definition is instrumental in defining the singlecross ing property.
DEFINITION1 (Karamardian and Schaible (1990)):A function H(c) is quasimonotone if L~'> L) and H(c)> 0 imply H(c')2 0.
A quasimonotone function H(c) crosses the line y = 0 at most once, and from below, as L) increases.
DEFINITION2: A function u(r ,a) has the single crossingproperty in (a; c) if for ally pair a' > a, u(L~, U(LI,
a') a) is quasimonotone in c.
Milgrom and Shannon (1994)call this the weak singlecrossingproper@. Suppose u(c, a) is differentiable in a. By Theorem 3 in Milgrom and Shannon (1994),if u(c, a) has the singlecrossing property in (a;L'), then du(c, a)/da is quasimonotone as a function of L).
DEFINITION3: Given two functions ~,(LI, a), we say that u, is more
a) and u,,(~~, risksensitice than u,, (and we write u,lu,,) if u, u,, has the singlecrossing property in (a; e). When u,+u,, and uIIlu,, we say that u, and u,, have the same degree of risksensitivity (ayd we write u, u,,).
Suppose u, and u,, are differentiable in a. Then uIluII means that du,(r.,a)/da crosses du,,(c, a)/da at most once, and from below, as r1 increases; see Figure 1.
The class of singlecrossing payoff functions is naturally connected with the notion of affiliation. When a singlecrossing payoff function is coupled with a signal Xq that is affiliated with V, the resulting optimal strategy aq(x) is nondecreasing in x (see Athey (19971, Jewitt (1987)).
DEFINITION4 (Milgrom and Weber (1982)): Two random variables X and V with joint density f(x, 11)are affiliated when
Affiliation implies that the ratio F(xic)/f(xic) is nonincreasing in c (see Milgrom and Weber (1982)). Affiliation between two random variables is equivalent to the monotone likelihood ratio property. A high realization of x is "good news" in the terminology of Milgrom (19811, in that it is associated with higher values of V. When X and V are affiliated, we use the terms affiliated signals and affiliated decision problem in the obvious way.
2.2. Assumptions
We focus on smooth decision problems, where signals vary continuously in the index 77 as defined in the following two assumptions.
Al: The payoff u(c, a) is differentiable in a, and the optimal action aq(x) is a differen tiable function of x and 7.
A2: For all (x, c) the functiorz Fq(xl~l) is differentiable with respect to 7 on E, and is continuous in c.
Assumption A1 is a restrictioll on the payoff and on the optimal strategy: it requires some knowledge about the solution of the decision problem. In particular the optimal strategy must be a smooth function of the signal. Many important economic models satisfy Al, including those in this paper.%ssumption A2 requires smoothness in the way the family of signals depends on 77; see Persico (1996a) for examples of families of signals satisfying A2.4
'This assumption is relaxed in Athey and Levin (1998). For example, A2 is satisfied if XT is distributed as a Uniform, or as a Normal, with mean i. and variance 1/~.
2.3. hzfornzation
The standard notion of informativeness of a signal is Blackw~ell's sufficiency. However, there are very few pairs of signals that are ranked in terms of sufficiency, including some that cannot be ranked despite one signal appearing intuitively to be more informative than the other. Thus, a more general (and easier to check) notioll of informativeness of signals is useful.
Here we use a notioll of informativeness which we call accuracy. Given two informa tion structures, verifying that one is more accurate than another is straightforward. In addition, whenever a signal is sufficient for another then it is also more accurate, but not conversely.%ccuracy, which has been proposed in the statistics literature (Lehmann (198811, also arises naturally in other economic contexts such as principalagent problems (see Jewitt (1997) and Kim (1995)). Accuracy is simpler to verify than sufficiency, and more intuitive. Section 2.4 below shows that accuracy is the appropriate concept for understanding the marginal value of informatioll in affiliated decision problems.
DEFINITION
5: Given two signals Xvand XR, we say that Xe is more accurate than Xq if
is nondecreasing in c, for every x.
We say that the family of signals {XT),. ,is A;ordered if a signal with a higher index is more accurate than a signal with a lower ~ndex. In order to understand better the concept of accuracy, note that from the definition of T,, ,,(x) it follows that
(1) T,, ,,(Xqlc) is distributed as XRIr,.
Thus, a more accurate signal can be obtained by subjecting a less accurate signal to the T,, ,,,transformation. The fact that T,, ,,, (x) is increasing in L. means that the T,, ,,, (.) transformation varies together with c: the new signal obtained by applying this transfor mation is higher than the old signal when L. is high, and lower when c is low. Hence, the notion of a more accurate signal can be interpreted as one of a signal that is more correlated with the random variable V; the T,,,,, (.) transformation imposes this addi tional correlatioll on the original signal."
'For instance, consider a signal distributed as a Uniform with mean u.Decreasing the variance of the uniform distribution makes the signal more accurate, but it does not make it more informative in Blackwell's sense. For details concerning the concept of accuracy and its relationship to sufficiency, see Persico (1996a). See also Athey and Levin (1998) for related concepts.
'Applying accuracy to hypothesis testing may be illuminating. Consider a case with two states of the world, I,, < I,;.Let Xq be an information structure affiliated with V. Any most powerful test of L , versus i,, has the form "accept 1.: if and only if Xq >sX."The probability of type I error is then Fq(s"~,~), F'J(x"l~',).
and the probability of type I1 error is 1 Let XH be more accurate than XT. Using information structure XH we can design a test that is more powerful than the above test. Indeed, choose I:", such that F"(x";~L.~)=Fq(x"lc2). Then the test "accept v2 if and only if
XH >X....:)i
has the same probability of type I error as the previous test. Furthermore, since Xvs more accurate than Xq. x": 2 Ffl~(Fq(x~~~,)l~,,).
This means that the test based on XH has lower probability of type I1 error; see Lehmann (1988).
The next theorem formalizes that Aorder is a necessary and sufficient condition for "better information," when XR,Xvare affiliated with V and the payoff satisfies the single crossing property.
THEOREM1: Suppose Xg,XTare affiliated with V. Then
For all payoffs u(c, a) hacing the
{Xgis more accurate than Xq}osinglecrossingproperty, R(O ) 2
R(7l).
PROOF: See Lehmann (1988).
2.4. The Marginal Value of Information
Consider two decision problems with the same statistical structure. Which of the two problems has the highest marginal return to information? Theorem 2 below says that it is the more risksensitive. For pictorial insight refer to Figure 1 where uI~uI,:intuitively, a marginal increase in the accuracy of information is more valuable in problem I since inferring the wrong value for L), and hence taking a suboptimal action, results in a larger marginal loss of utility than in problem II. Once this is established, Theorem 2, part (iii) tells which of the two decision problems will yield greater illformatioll acquisition. Note that Theorem 2 holds a fortiori if acquiring information is taken to be in the sense of Blackwell, because if two signals are ranked according to sufficiency they are llecessarily ranked according to accuracy.
THEOREM2: Gicen 7and d,consider two payofffunctions u, and u,, associated to the same Aordered statistical structure, gicing rise to two information acquisition problems satisfiing A1 and A2. If u,(c, a?(x)) +u,,(c, a?,(x)), then:
 (i)
 MR,(a) 2 MRII(~);
 (ii)
 if u,(L', a:(x)) u,,(c, a?,(x)), then MRI(~) =MRII(~);
(iii) the set of optimal accuracies in problem I is higher, in the strong set order,' than that of problem II.
PROOF: For part (i), notice that
Denoting
Given A and B subsets of the real line, we say that A is higher than B in the strong set order when, for every a EA and b E B we have max{a, b) EA and min{a, b) E B.
we wish to show that
Expression (1) on page 139 suggests a change of variable: we can rewrite ;VfR,(r))MR,,(q) as
Differentiabilitj of the above expression is guaranteed by Al, A2. The inner integral can be computed as
x dGq(rlx).
The first order conditio~ls for problems I and I1 are
Thus, equation (3) simplifies to
Now we want to applj Lemma 1 in Appendix A to conclude that expression (41, and hence (21, are nonnegative; this will conclude the proof. To this end we note that du"(i, x)/dx is quasimonotone by assumption. By the firstorder conditions
It remains to show that dT,, ,,(x)/dO is nondecreasing in is: write
The term T,,,,,,(x) =x is independent of 1,. Since T,,,,,(x) is nondecreasing in i, by assumption, we obtain that dT,, ,,,(x)/dO is nondecreasing in i, as required."
Reasoning along the lines of this proof. it is possible to obtain a .'marginal version" of Theorern
1. See Persico (1996a) for details.
Part (ii) is straightforward.
Part (iii) follows from the fact that the function R,,(q) C(q) (where m =I, I1 and I1< I) is seen to have the singlecrossing property in (q; m).This is easily proved using part (i) above. Then Theorem 4 by Milgrom and Shannon (1994) on monotone compara tive statics yields the results. Q.E.D.
The intuition for this result is the following. In view of expression (I), acquiring a more accurate signal is equivalent to observing y = T,,,(x) instead of x. Because T,, ,,, (.) is increasing in c, y will be larger than x if c is high, and smaller if c is low. Thus, for each c the action a,(y) is closer than a,(x) to argmax,u(a, u). This increases the payoff to the decision maker (these last two steps make use of the fact that the payoff is singlecross ing: see Figure 1). How much the payoff increases, however, depends on how steeply u(a, c) increases as a moves towards argmax,u(a, v). The steepness of this increase is precisely the risksensitivity of the payoff.
In general, checking that u,(c, ay(x)) +u,,(c, ayI(x)), as required by Theorem 2, requires some knowledge of the optimal action in decision problems I and 11. However, this is not the case in the application to auctions, as we see in the next section.
3. AUCTIONS
In this section we use the results developed above to discuss information acquisition in first and second price auctions.
3.1. The Auction Model
There are two players, 1and 2,9 and an object to be auctioned whose value to player i is u, = u(T/;,V)). The function u(c,, c,) is increasing in v, and nondecreasing in u,. V, and V2 are random variables unobserved by the players; players share a prior g(cl,c2) on their distribution, with g(., .) a symmetric affiliated density function.
Player i chooses a signal X: from a family {XYX, .,at a cost C(q). X: has a density fJ(x,jc,) whose c.d.f. satisfies A2. Thus, X: conveys information about u,. X: is affiliated with y. The family of signals is Aordered, and E = [q,m). We assume C(q) = 0. The interpretation is that agents receive a signal of accuracy q for free, and may choose to improve the accuracy of their signal at a cost C(q). FG~each q1,q2 chosen by the bidders, the joint distribution of signals and value is
Given this statistical structure," XI, X2, V,, and V2 are affiliated (see Theorem 1 (ii) in Milgrom and Weber (1982)). Let ii(ci, xj) = E(u(y, ?)IT/; = ci, Xj =xj). Two special cases of this model are, independent signals when g(cl, c,) =g(ul)g(v2), and the mineral rights model when V, = V, = V. The m information acquisition game consists of two stages:
(i) player i chooses qi, independently from, and simultaneously with, his opponent.
(ii) after observing the realization of Xp,but not the opponent's choice of qj, players compete for the object in mechanism m.
This is for expositional ease: all the results carry over to the nbidders case.
A pure strategy in the m information acquisition game is a pair bill(.)) listing the accuracy choice in stage (i) and the strategy in the subsequent bidding stage. A symmetric pure strategy combination for the 11z information acquisition game is a pure strategy combination of the form: in the first stage, both players acquire a signal of accuracy qll; in the second stage, both players play strategy h,,,(.) in mechanism r?z. We model information acquisition as a coc.ert activity. which means that in stage (ii) players do not observe the opponent's accuracy choice before bidding. This allows us to apply the results in the previous section to characterize the equilibrium of the game.
We introduce some notation about the marginal benefit from increasing accuracy. First. we define the marginal benefit from increasing accuracy starting from 7, when the opponent has accuracy 0 and moreover (wrongly) thinks the situation is symmetric at 0. Let
A:VIR,,,( 0,7) := player 1's marginal revenue from increasing 7 in mechanism m when (a) player 1has accuracy 7, and (b) is best responding to a player 2 who has accuracy 0 and plays the symmetric equilibrium strategy as if both players had accuracy 0.
Let now
;vR,,,(7) :=A.MR,,,(7.a).
.2.1R,,,(77) is the marginal revenue from increasing accuracy when both bidders have accuracy 7. We denote with MC(7) the marginal cost of increasing accuracy.
3.2. First L'S. Second Price Azlction
We first show how the auction model of Section 3.1 relates to the analysis of Section 2. Consider a second price auction. Let us check that a bidder faces an affiliated decision problem when choosing his bid. Bidders 1 and 2 receive signals X, and X2 respectively, and bid for an object of value V. Suppose that the joint density for XI, X,, V,, and V2 is
.f(x,lcL)f(xzlc~7)g(l'1.1~2).
The problem of bidder 1 with signal x, in a second price auction is
where
i (.I,, x2) =E(LI(V,,V~))X~=,I]. X2=x1)
and b,(x2) is bidder 2's strategy. Substituting for c(x,. x,) jields where
A similar analysis can be performed on the first price auction, to get
where b, denotes bidder 2's strategy. As is well known (see, for example, Athey (1997)), u,(v,, b) and u,(v,, b) have the singlecrossing property in (b;u,). Thus, the bidders' decision problems in first and second price auctions are of the type analyzed in Section 2. Then, in view of Theorem 1, accuracy is the appropriate concept of "better information" for a first or second price auction: increasing the accuracy of one's information is beneficial, irrespective of the opponent's strategy and accuracy level. This observation is formalized in the following Fact.
FACT1: Consider the first and second price information acquisition games described in Section 3.1. Let the index m = F,S denote a first and second price auction, respec tively. Suppose player 2 has accuracy 0 and plajs any increasing strategy b:(.). Suppose player 1 has accuracy 7 and plays his best response to b:(.). Then for all (7,O), increasing 7 is beneficial to player 1. Formally, AMRF(O, 71, AMR,(O, 7)> 0.
The next proposition proves that at a symmetric equilibrium the marginal return to information is higher in a first price auction than in a second price.
PROPOSITION1: Consider the first and second price informatiorz acquisitiorz games de scribed in Sectiorz 3.1. Then MR,(7) 2 MR,(7) for all 7.
PROOF: In view of Theorem 2, it is enough to show that u,(v, b;,'(x,))>u,(u, bJ(x,)).

For a second price auction we have, at a symmetric equilibrium,
For a first price auction we have
whence We need to show that
is quasimonotone. This expression reads
Since X, and Vl are affiliated, F,~$x,~~,)/f~l(x,r~,)is nonincreasing in L.,. Thus, expression (6) is quasimonotone in r ,. Q.E.D.
The proof of Proposition 1 hinges on the properties of F(xlc\)/f(xl~.).This ratio can be interpreted as an index of the "money left on the table" by the winner in a firstprice auction. When F(xli,)/f(xli,)is very large, the probability that your opponent is bidding close to you is small. Then, in a first price auction you could save money by reducing your bid, and still be winning wit11 almost the same probability: in other words, lots of money is left on the table. By contrast, in a second price auction this deviation is not profitable because you pap the other player's bid: no money is left on the table in a second price auction. An additional bit of correlation with r (information) is more useful in a first price auction because it allows to correlate more closely your bid with the opponent's, and thus to reduce the money left on the table.'"
We next translate Proposition 1 into a statement about symmetric pure strategy equilibria of the information acquisition games. A necessary condition for a symmetric equilibrium at (rj,;, 77,;) is that Me(.) intersects MR,,,(.) from below in rj,;. In view of Proposition 1 the following is straightfornard:
FACT2: Suppose a symmetric pure strategy equilibrium exists for a first and second price information acquisition game described in Section 3.1. If Me(.) only intersects MR,(,) once. then the equilibrium accuracy in the first price auction rj? will be higher than or equal to rj:, the accuracy in a second price auction.
The question then is which cost functions satisfy the conditions of Fact 2. A cost function of the form C(rl)= (rj rj)a will certainly do for cu sufficiently high. Indeed, if cu is large enough we are guarantezd that 1WC crosses the MR,,, functions only once, and from below, at 7,;:then Fact 2 applies. To check that an equilibrium exists at rjij:, we must also check that MC(rj) <AMR,,,(rj~.rj) if and only if rj < rjr,':.This is guaranteed by choosing cu sufficiently large, because by Fact 1 A:VIR,(rj;i', rj), A;\4R,7(rj,F, rj) > 0. These observations are collected in the following corolla^.
COROLLARY1: Take a cort furzctiorl C(rj)= (rj rjIn arzd ail cu .~~4ficientlj~
izigh. Ti~en for the first and second price irzforrnatiorz acq~~isitiorz &me described in Secriorz 3.1, a pure strategy symmetric equilibrium exists arzd is urziq~~e. is higher irz the first
Eqzlilibrium acc~~racy than in the secorzd price game.
10 In the limiting case where V, and V2are independent, acquiring information about i., does not make player 1 more correlated with player 2's bid. I11 this case F~~(~~i~~)/f;l?(.~,li~,)
is independent of r, and thus ;WR, = 1\4R,.
What about the revenue to the auctioneer? An important result in auction theory states thatwhen the information structure is exogenously fixeda second price auction gives the auctioneer a higher expected profit than a first price auction (Milgrom and Weber (1982)). However, when information acquisition is allowed as in our model, it is possible that a first price auction yields more revenue than a second price. See Persico (1996b) for an example.
4. DISCUSSION AND RELATED LITERATURE
We obtain an explicit expression for the marginal value of information in the class of decision problems where the payoff function exhibits the singlecrossing property and the statistical structure is affiliated. We show that the value of information in such decision problems is determined by the degree of risksensitivity of the payoff.
We use this result to demonstrate how auction formats can be ranked in terms of bidders' incentives to acquire information about the object for sale. Different auctions use winning and losing bids in different ways to determine payoffs. Since learning about the object for sale conveys information about the opponent's bid, information about the object is more valuable in auctions where information about the opponent's bid is more important. Our work shows how bidders' information acquisition behavior varies across auction formats. We find that a first price auction is more risksensitive than a second price, and thus information is more valuable in the former. This is because in a first price, more information allows the winning bidder to reduce the money left on the table. This effect is absent in a second price auction: there is no money left on the table there. This makes information more valuable in a first price.
In contrast to most results on the value of information in oligopoly games, we analyze a very general model of information. acquisition without resorting to special functional forms. Our results should be compared with the existing literature on information acquisition in auctions. In an unpublished work, Matthews (1977) compares a first and a second price auction: the two auction forms are found to give the same incentives to acquire information. Similarly, Hausch and Li (1991) find no difference in the incentives to acquire information, among all independent privatevalues auction mechanisms. Our work makes clear that this is due to their choice of statistical structure." In a recent work independent of ours, Gaier (1995) takes up Matthews' primitives and finds that a first price auction gives stronger incentives to acquire information than a royalty rate auction. This result can be couched in the terms of the present paper, and is discussed in Persico (1996b). The techniques presented here are used in Persico (1996b) to compare other auction forms in terms of marginal incentives to acquire information.
The ideas developed in this paper translate immediately to modeling research and development. Consider the following more general specification for the value to player i: u, = u(l.;, y,X,,7,). Here, increasing accuracy may have a valueenhancing (or costre ducing) effect, and receiving a high signal may be good for the payoff. These features allow us to reinterpret increasing accuracy as R&D activity, and all the results in the present work apply. Tan (1992) presents a model where, prior to a procurement auction, firms invest in costreducing R& D. Tan finds that first and second price are equivalent in terms of incentives to invest. Using the intuition developed here helps to interpret that result. In Tan's model, the R&D activity is one of independent stochastic cost reduction,
l1 The statistical structures of Matthews (1977, 1984) and Hausch and Li (1991) share the feature that FX2(~1~~l)/fX2(~1c1)
is independent of c,.
in that a firm's decision to reduce costs does not make its cost function statistically more correlated with the other firm's. Thus, once again an independence assumption is key to the result. Our work shows that if this assumption is relaxed a first price auction induces more investment in R&D than a second price.
Dept. of Economics, Dilire~sityof Penns~h~arrirr,3718 Loc~istWrlk, Plzilrrclelpllirr, PA 191046297, USA.;per.sico@~econ.srrs.~i~~enr~.ed~~; / peisico
htrp://~u~u~~.ssc.~~~~enrz.crlu
APPENDIX
The follo\ving lemma is used in the literature to establish comparative statics results in 5etups with the monotone likelihood ratio and the singlecrossing property. The lemma is also widcly used in the literature on comparative statics of risk (sce Eeckhoudt and Gollier (1994)).
LEMMA 1: Let (c,d) be nil ii~teiz~iilof rile r.iw1 line. J(.) rr rioildecr.cnsii~g fiii~ctiorz. H(.) (I qllasimoilotonefi~nctior~. u,e /zni'e
Asslinze tiltit for. sorile rneiislirr y or1 91
PROOF: Because H is quasimonotone and satisfies (71, there must be a I.,, E [c,dl such that H is nonpositive for 1. < L,,. and nonnegative for 1, > L,,. Denote j(c.1 := J(i3)J(I.,,). Since J(.) is nondecreasing, j(i.1 is nonpositive for 1, < i,,; and nonnegative for L > r,,. Then
where the first equality uses (7) and the inequality follows from If and j having the same sign oil (c. ru) and (L,,,, rl). Q.E.D.
REFERENCES
ATHEY. S. (1997): "Monotone Comparative Statics in Stochastic Optimization Prol~lrrns." Working Paper, MIT. ATHEY,S.; AND D. LEVIN (1998): "The Value of Information in hlonotone Decision Problems." Working Paper, MIT. EECKHOUDT. (1991): "Demands for Rish Assets and Stochastic Dominance: A
L.. AND C. GOLLIER Note," Mimeo. GAIER, E. (1995): "Endogenous Information Quality in Common l'alue Auctions." Mimeo. Duke Universit).
HAUSCH,D., AND L. LI (1991): "Pri'iate Values Auctions with Endogenous Information: Revenue Equivalence and NonEquivalence," IVorking Paper. School of Business. University of LVisconsin. Madison.
JEWITT, I. (1987): "Risk A~ersion and the Choice Between Risk> Prospects: The Presenation of Comparative Statics Results." Rei,ie,r, of Ecorior7iic Stiitlies, 54, 7385. (1997): "Information and Principal Agent Problems," Mimeo.
KARAIVIARDIAN, (1990): "Seven Kinds of Monotone Maps," Journal of Optimiza
S,. AND S. SCHAIBLE tion Theory rind Applicatior7s, 66, 3746. KIIVI, S. K. (1995): "Efficiency of an Information System in an Agency Model," Econometrica, 63, 89102. LEHIVIANN,
E. (1988): "Comparing Location Experiments," The Annals of Statistics, 16, 521533.
MATTHEWS,S. (1977): "Information Acquisition in Competitive Bidding Processes," Mimeo, Califor nia Institute of Technology, Pasadena.

(1984): "Information Acquisition in Discriminatory Auctions," in Bayesian Models in Economic Tl~eory, ed. by M. Boyer and R. E. Kihlstrom. New York: Elsevier Science Publishers. MILGROM, Jo~~rnnl
P. (1981): "Good News and Bad News: Representation Theorem and Applications," Rand of Ecorlomics, 12, 380391.
MILGROM, (1994): "Monotone Comparative Statics," Econometrica, 62, 157180.
P., AND C. SHANNON MILGROIVI, (1982): "A Theory of Auctions and Competitive Bidding," Economet
P., AND R. ~EBER
rica, 50, 10891122.
PERSICO,N. (1996a): "Information Acquisition in Affiliated Decision Problems," Discussion Paper 1149, Center for Mathematical Studies in Economics and Management Science, Northwestern University.
(1996b): "Information Acquisition in Auctions," Working Paper 726, UCLA Department of Economics. TAN,G. (1992): "Entry and R&D in Procurement Contracting," Journal of Economic Theory, 58, 4160.
Comments