Abstract
We consider how information concentration affects a seller’s revenue in common value auctions. The common value is a function of \(n\) random variables partitioned among \(m \le n\) bidders. For each partition, the seller devises an optimal mechanism. We show that whenever the value function allows scalar sufficient statistics for each player’s signals, the mechanism design problem is well-defined. Additionally, whenever a common regularity condition is satisfied, a coarser partition always reduces revenues. In particular, any merger or collusion among bidders reduces revenue.
Similar content being viewed by others
Notes
Common value auctions appear especially sensitive to asymmetries. Bikhchandani and Riley (1991) notes that even vanishing asymmetries can lead an advantaged bidder to win the auction with probability 1. Klemperer (1998) provides discussion of this result in relation to the FCC spectrum auctions. Symmetric models can significantly overstate price changes following a merger of smaller firms in asymmetric industries (Dalkir et al. 2000; Tschantz et al. 2000).
The differentiability assumption is very mild. By Assumption 1, the functions \(\phi ^{A_{i}}\) are monotone and thus almost everywhere differentiable.
Note also that, we represent the transition from concentrated to non-concentrated environments at a very abstract level. Any bidding ring can be dissolved into its component members. This has the flavor of ex-post implementation in its incentive compatibility requirement for the representative of the ring. In multidimensional problems, Bikhchandani (2006) shows that a single-crossing condition akin to scalarization is required for the existence of ex-post implementation.
The existence of an optimal scalar mechanism implies that a bidder does not receive information rents for equivalent types—types that share the same value of a sufficient statistic. If this were not the case, then the auctioneer, through sophisticated incentive constraints, would pay a bidder for revealing a specific type among equivalent types (Armstrong and Rochet 1999).
Thomas (2004) demonstrates how “a profitable efficiency increasing merger of two relatively small firms creates a stronger competitor that can cause the expected price to fall [in procurement settings], despite the resulting increase in market concentration”. (p. 688).
For example, see the comments of Andrew R. Dick, former Acting Chief of the policy section at the DOJ Antitrust Division, J. Mark Gidley, Assistant Attorney General for Antitrust, and David T. Scheffman, former Director of the FTC’s Bureau of Competition, who all suggest that asymmetry-reducing mergers can provide market efficiencies (FTC/DOJ 2004).
Bidder 1’s payment will be zero.
References
Armstrong M, Rochet J-C (1999) Multi-dimensional screening: a user’s guide. Eur Econ Rev 43(4–6):959–979
Athey S, Levin J (2001) The value of information in monotone decision problems. Working Paper, MIT
Bagnoli M, Bergstrom T (2005) Log-concave probability and its applications. Econ Theory 26(2):445–469
Bergemann D, Valimaki J (2002) Information acquisition and efficient mechanism design. Econometrica 70(3):1007–1033
Biais B, Martimort D, Rochet J-C (2000) Competing mechanisms in a common value environment. Econometrica 68(4):799–837
Bikhchandani S, Riley J (1991) Equilibria in open common value auctions. J Econ Theory 53(1):101–130
Bikhchandani S (2006) Ex post implementation in environments with private goods. Theor Econ 1(3):369–393
Bulow J, Klemperer P (1996) Auctions versus negotiations. Am Econ Rev 86(1):180–194
Bulow J, Klemperer P (2002) Prices and the winner’s curse. RAND J Econ 33(1):1–21
Cantillon E (2008) The effect of bidders’ asymmetries on expected revenue in auctions. Games Econ Behav 62(1):1–25
Crémer J, McLean R (1988) Full extraction of the surplus in bayesian and dominant strategy auctions. Econometrica 56(6):1247–1257
Dagen R, Richards D (2006) Merger theory and evidence: the baby-food case reconsidered. Tufts University Department of Economics, Working Paper
Dalkir S, Logan JW, Masson RT (2000) Mergers in symmetric and asymmetric noncooperative auction markets: the effects on prices and efficiency. Int J Ind Organ 18(3):383–413
DeBrock L, Smith J (1983) Joint bidding, information pooling, and the performance of petroleum lease auctions. Bell J Econ 14(2):395–404
Froeb L, Shor M (2005) Auction models. In: Harkider JD (eds) Econometrics: legal, practical, and technical issues, pp 225–246. American Bar Association Section of Antitrust Law
FTC/DOJ (2004) Joint workshop on merger enforcement. February 17–19, Washington, D.C.
Goeree JK, Offerman T (2002) Efficiency in auctions with private and common values: an experimental study. Am Econ Rev 93(3):625–643
Jackson MO (2009) Non-existence of equilibrium in vickrey, second-price, and english auctions. Rev Econ Des 13(1):137–145
Klemperer P (2005) Bidding markets. UK Competition Commission, Occasional Paper No 1
Klemperer P (1998) Auctions with almost common values: the ‘wallet game’ and its applications. Eur Econ Rev 42(3–5):757–769
Krishna V, Morgan J (1997) (anti-) competitive effects of joint bidding and bidder restrictions. Penn State University and Princeton University, Working Paper
Mares V, Harstad RM (2003) Private information revelation in common-value auctions. J Econ Theory 109(2):264–282
Mares V, Shor M (2008) Industry concentration in common value auctions. Econ Theory 35:37–56
Mares V, Shor M (2012) On the competitive effects of bidding syndicates. B.E. J Econ Anal Policy [Frontiers] 12:1–32
Matthews SA (1984) Information acquisition in discriminatory auctions. In: Boyer M, Kihlstrom RE (eds) Bayesian models in economic theory. Elsevier Science, pp 181–207
McAfee RP, Reny PJ (1992) The competitive effects of mergers between asymmetric firms. Correl Inf Mech Des 60(2):395–421
Myerson R (1981) Optimal auction design. Math Oper Res 6(1):58–73
Persico N (2000) Information acquisition in auctions. Econometrica 68(1):135–148
Prékopa A (1971) Logarithmic concave measures with application to stochastic programming. ACTA Sci Math (Szeged) 32:301–316
Prékopa A (1973) On logarithmic concave measures and functions. ACTA Sci Math (Szeged) 34:335–343
Reny PJ, Zamir S (2004) On the existence of pure strategy monotone equilibria in asymmetric first-price auctions. Econometrica 72(4):1105–1125
Thomas CJ (2004) The competitive effects of mergers between asymmetric firms. Int J Ind Organ 22(5):679–692
Tschantz S, Crooke P, Froeb L (2000) Mergers in sealed vs. oral auctions. Int J Econ Bus 7(2):201–213
Waehrer K, Perry MK (2003) The effects of mergers in open-auction markets. RAND J Econ 34(2):287–304
Werden GJ, Froeb LM (1994) The effects of mergers in differentiated products industries: logit demand and merger policy. J Law Econ Organ 10(2):407–426
Author information
Authors and Affiliations
Corresponding author
Additional information
The authors would like to thank Luciano de Castro, Luke Froeb, Paul Klemperer, Rich McLean, Rakesh Vohra, and an anonymous referee for valuable comments and suggestions.
Appendix
Appendix
1.1 Proof of Theorem 1
The proof requires three lemmas. Fix the player for whom the value functions admit sufficient statistics to be player 1.
Lemma 1
Under any incentive compatible mechanism, \(\eta ,\) the expected surplus of equivalent types is equal.
Proof
For every mechanism \(\eta =(p_{i}(\cdot ),\xi _{i}(\cdot ))\) define
and
Under mechanism \(\eta \), the expected payoff for player \(j\) who has information \(\mathbf{s}_{j}\) and reports \(\mathbf{t}_{j}\) is
The interim incentive compatibility constraint for player \(1\) is
for all \(\mathbf{s}_{1}\) and \(\mathbf{t}_{1}.\) For two equivalent types \( \mathbf{s}_{1}\) and \(\mathbf{s}_{1}^{\prime }\) and any \(\mathbf{t}_{1}\), we have by definition
and in particular
Combining expressions, we have
where the equality holds by (7) and the inequality by (5), substituting \(\mathbf{s}_{1}^{\prime }\) for \(\mathbf{t}_{1}.\) Also, by substituting \(\mathbf{s}_{1}\) for \(\mathbf{t}_{1}\) and \(\mathbf{s} _{1}^{\prime }\) for \(\mathbf{s}_{1}\) in (5), we have
where the equality follows from (6). Combining (8) and (9), we obtain
\(\square \)
Consider the mechanism \(\eta ^{\prime }\) as defined by Eqs. (1) and (2).
Lemma 2
If mechanism \(\eta \) is incentive compatible, then \(\eta ^{\prime }\) is an incentive compatible mechanism.
Proof
Define \(f_{\phi ^{A_1}}\) as the density of \(\phi ^{A_1}(\mathbf{S}_{1}).\) Also, for every \(\mathbf{s}_{1}\), such that \(\phi ^{A_1}(\mathbf{s}_{1})=\alpha \), denote by
the parametrization of \(i\)’s value function based on the sufficient statistic’s value. Since \(\eta \) is a mechanism, we have \(p_{i}(\mathbf{s} _{1},\mathbf{s}_{-1})\ge 0\) and \(\sum p_{i}(\mathbf{s}_{1},\mathbf{s} _{-1})\le 1\) for every \(i\) and every \((\mathbf{s}_{1},\mathbf s _{-1})\). This implies by integration over the set of equivalent types that for \(i\) and \(\mathbf{s}_{1},\)
and similarly
The interim incentive compatibility condition for player \(j\) under mechanism \(\eta \) is
for all \(\mathbf{s}_{j}\) and \(\mathbf{t}_{j}.\) For bidder \(j\ne 1\),
Similarly, for all \(\mathbf{s}_{j}\) and \(\mathbf{t}_{j},\)
Substituting the identical terms into the incentive compatibility constraint we get
for all \(\mathbf{s}_{j}\) and \(\mathbf{t}_{j}\) which indicates that mechanism \(\eta ^{\prime }\) is incentive compatible for player \(j\).
Finally, we need to show that player \(1\)’s incentive compatibility constraint is satisfied under mechanism \(\eta ^{\prime }.\) Define
and
which are player 1’s expected asset value and expected payment when his type is equivalent to \(\mathbf{s}_1\) and he reports a type equivalent to \( \mathbf{t}_1\).
The previous lemma establishes that for equivalent types \(\mathbf{s}_{1}\) and \(\mathbf{s}_{1}^{\prime }\),
and therefore, by the definition of equivalent types,
Integrating these relationships along the set of equivalent types with respect to \(f_{1}(\mathbf{s}_{1}^{\prime }|\phi ^{A_1}(\mathbf{s}_{1}^{\prime })=\phi ^{A_1}(\mathbf{s}_{1}))\) results in
Player 1’s incentive compatibility constraint under \(\eta \) for nonequivalent types \(\mathbf{s}_{1}\) and \(\mathbf{t}_{1}\) is
Integrating these relationships along the set of equivalent types to \( \mathbf{t}_1\) yields
Combining (10) and (11) yields
which is the incentive compatibility constraint for player \(1\) under mechanism \(\eta ^{\prime }.\) \(\square \)
Lemma 3
The mechanisms \(\eta \) and \(\eta ^{\prime }\) are revenue-equivalent.
Proof
The expected revenue for the seller under mechanism \(\eta \) is
\(\square \)
Proof of Theorem 1
Follows from the above three lemmas. \(\square \)
1.2 Proof of Theorem 2
1.2.1 Notation
For notational convenience, we consider the case where buyer \(1\) and \(2\)’s information is centralized under the control of a new buyer \(c\). Let
and
where \(A_{c}=A_{1}\cup A_{2}\) and \(A_{i}=A_{i}^{\prime }\) for all \(i\ge 3\). All the other cases can be derived from this analysis. For simplicity, we drop the superscript in \(\phi ^{A_c}(X_1,X_2)\) and denote the sufficient statistic by \(\phi (X_{1},X_{2})\).
For every \(t\) in the support of \(\phi (X_{1},X_{2})\) define:
and
analogously define \(\underline{x}_{2}(t)\) and \(\overline{x}_{2}(t).\) Note that these objects are well-defined and increasing when \(\phi (\cdot ,\cdot )\) is increasing.
Define implicitly for every \(t, \psi _{2}(\cdot ,t):[\underline{x}_{1}(t), \overline{x}_{1}(t)]\rightarrow [\underline{x}_{2}(t),\overline{x} _{2}(t)]\)
and \(\psi _{1}(\cdot ,t):[\underline{x}_{2}(t),\overline{x} _{2}(t)]\rightarrow [\underline{x}_{1}(t),\overline{x}_{1}(t)]\)
Note that \(\psi _{1}(\cdot ,t)\) and \(\psi _{2}(\cdot ,t)\) are well-defined decreasing functions and \(\psi _{1}^{-1}(\cdot ,t)=\psi _{2}(\cdot ,t)\). Further, when \(\phi \) is differentiable then so are \(\psi \) and \(\psi _{2},\) and
or
and analogously
Note that if \(\phi (x_{1},x_{2})=t\)
and therefore
By a similar argument one can show that
and for all \(j\ge 3\)
which means that \(\partial _{tj}V^{\mathbf{A}^{\prime }}\) and \(\partial _{1j}V^{\mathbf{A}}\) will have the same sign.
Lemma 4
The survival function and density function of \(\phi (X_{1},X_{2})\) are given by
Proof
Note that
Since \(X_{1}\) and \(X_{2}\) are independent, we have
Substituting back into the integral yields the first expression. Note that
or
Then,
Substituting Eq. (18) yields:
\(\square \)
Proof of Theorem 2
Under our assumptions, every buyer’s information can be summarized by \(T_{i} =\phi ^{A_{i}}(\mathbf{S}_{i})\) and in any scalar mechanism for information profile \(\mathbf{A}\) only reports \(t_{i}\) are required from buyers. In the concentrated environment \(\mathbf{A}^{\prime }\), a scalar mechanism will require reports \(t_{i} =T_{i}\) from buyers \(3\) through \(m\), while it will ask buyer \(c\) to submit a report \(t_{c}=\phi (t_{1},t_{2}).\) Denote by \( f_{i}(t_{i}),F_{i}(t_{i})\) and \([\underline{a}_{i},\overline{a}_{i}]\) the density, distribution function and, respectively, support of the random variables \(T_{i}.\) Further, denote by \(f_{\phi }\) and \(F_{\phi }\) the density and distribution function of the random variable \(\phi (T_{1},T_{2}). \) Denote by \(t_{-i}\) and \(t_{-ij}\) the vector of reports excluding buyer \(i\) or buyers \(i\) and \(j\).
Consider the virtual valuation of player \(c\),
Under the regularity assumption, \(H_{c}^{\mathbf{A}^{\prime }}(\cdot ,t_{-12}) \) is non-decreasing.
Following (Bulow and Klemperer 1996), for any mechanism \(\eta ^{\prime }\!=\!\left( p_{i}^{\prime },\xi _{i}^{\prime }\right) _{i\in \{c,3,\ldots ,m\}}\) in environment \(\mathbf{A}^{\prime },\) the seller’s revenue is
where \(v_{0}\) is the seller’s reservation value. Point-by-point maximization of the integrand yields the optimal solution \(\mu ^{\mathbf{A}^{\prime }}\) where
and zero otherwise. Since the functions \(H_{i}^{\mathbf{A}^{\prime }}\) are non-decreasing, \(H_{i}^{\mathbf{A}^{\prime }}(t_{i},t_{-i})\ge v_{0}\) implies \( H_{i}^{\mathbf{A}^{\prime }}(t_{i}^{\prime },t_{-i})\ge v_{0}\) for all \( t_{i}^{\prime }\ge t_{i}.\) Further, for all \(j\), and for all \(t_{i}^{\prime }\ge t_{i}\), by Assumption \(1\) we have \(H_{i}^{\mathbf{A}^{\prime }}(t_{i}^{\prime },t_{-i})\ge H_{j}^{\mathbf{A}^{\prime }}(t_{i}^{\prime },t_{-i}).\) In particular, for bidder \(c\) we have
and zero otherwise. We conclude thus that for any \(t_{-12}\) and \(v_{0}\), the set of types for which bidder \(c\) gets the object is given by
for some function, \(\tau \). The expected payment received by the auctioneer from bidder \(c\) is therefore,
Define
then
Consider a mechanism \(\mu ^{\mathbf{A}}=\left( p_{i},\xi _{i}\right) _{i\in \{1,2,\ldots ,m\}}\) for the environment \(\mathbf{A}\), with the following properties \(p_{1}(t_{1},t_{-1})\equiv 0,p_{2}(t_{1},t_{2},t_{-12})\equiv p_{c}^{\prime }(\phi \left( t_{1},t_{2}\right) ,t_{-12})\) and \( p_{i}(t_{i},t_{-i})\equiv p_{i}^{\prime }(t_{i},t_{-i})\) for all \(i\ge 3.\) The mechanism \(\mu ^{\mathbf{A}}\) is incentive compatible since all the functions are non-decreasing in own type.Footnote 7 Furthermore, the expected payment received from bidders \(3\) through \(n\) ,under \(\mu ^{\mathbf{A}}\) and \(\mu ^{\mathbf{A} ^{\prime }}\)are the same\(.\)
The expected payment from bidder \(2\) in this case is therefore
Define
then
In particular, we will show that for all \(t\)
the expected payments of bidder \(c\) under \(\mu ^{\mathbf{A}^{\prime }}\) and those of bidder \(2\) under \(\mu ^{\mathbf{A}}\) coincide, which makes the two mechanisms revenue-equivalent. Define
and note that \(Q(t)\) may be expressed as
We consider each component separately. First,
Fix \(t_{1}\) and introduce the change in variable \(t_{2}=\psi _{2}(t_{1},t_{c}),\)observing that \(dt_{2}=\partial _{t_{c}}\psi _{2}(t_{1},t_{c})dt_{c}.\)
The integral becomes
Where the first equality follows from Eq. (18), the second from (14) and Fubini’s theorem, and the last by Lemma 4.
The second part of the integral in (20) is
Combining the two results we have
which means that \(\mu ^{\mathbf{A}}\) and \(\mu ^{\mathbf{A}^{\prime }}\) generate the same expected revenue. However, under \(\mu ^{\mathbf{A}}\), buyer \(1\) receives the good with probability zero. If the optimal mechanism in environment \(\mathbf{A}\) allocates to buyer \(1\) with strictly positive probability, then it is, by definition, revenue superior to \(\mu ^{\mathbf{A} }\) and hence to \(\mu ^{\mathbf{A}^{\prime }}\). \(\square \)
Rights and permissions
About this article
Cite this article
Mares, V., Shor, M. Information concentration in common value environments. Rev Econ Design 17, 183–203 (2013). https://doi.org/10.1007/s10058-013-0143-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10058-013-0143-0