On the choice of obtaining and disclosing the common value in auctions

This paper introduces a game-theoretic analysis of auction settings where bidders' private values depend on an uncertain common value, and the auctioneer has the option to purchase information that can eliminate that uncertainty. Therefore the auctioneer needs to decide whether to purchase the information, and if so, whether to disclose it to the bidders. Unlike prior work, the model assumes that bidders are aware of the auctioneer's option to purchase the external information but are not necessarily aware of her decision. The modeling of the problem as a Stackelberg game, where the auctioneer is the leader, is complicated by the fact that in cases where the auctioneer decides not to disclose the information, the situation is actually modeled as a version of Stackelberg game where the follower has potentially imperfect information about the leader's actions. Our analysis of the individual expected-benefit-maximizing strategies results in the characterization of the pure-strategy perfect Bayesian Nash equilibrium and proof of its existence for any setting. In addition, we introduce an algorithm for extracting the equilibrium as a function of the information cost, which is of great importance when the information is provided by a strategic information-provider. The analysis is also extended to deal with mixed-strategy perfect Bayesian Nash equilibrium and with noisy information. Overall, the analysis enables the demonstration of various model characteristics, including many non-intuitive properties related to the benefits of competition, the benefits in having the option of the auctioneer to purchase such information and the benefits encapsulated in the bidders' awareness of such an option.

[1]  E. H. Clarke Multipart pricing of public goods , 1971 .

[2]  Ennio Stacchetti,et al.  The English Auction with Differentiated Commodities , 2000, J. Econ. Theory.

[3]  M. Spence Job Market Signaling , 1973 .

[4]  Péter Eso An optimal auction with correlated values and risk aversion , 2005, J. Econ. Theory.

[5]  George A. Akerlof The Market for “Lemons”: Quality Uncertainty and the Market Mechanism , 1970 .

[6]  J. Douglass Klein,et al.  The Price Effects of Increased Competition in Auction Markets , 1987 .

[7]  Ruqu Wang Auctions versus Posted-Price Selling: The Case of Correlated Private Valuations , 1998 .

[8]  M. Spence Signaling in Retrospect and the Informational Structure of Markets , 2002 .

[9]  Paul R. Milgrom,et al.  Rational Expectations, Information Acquisition, and Competitive Bidding , 1981 .

[10]  Moshe Tennenholtz,et al.  Signaling Schemes for Revenue Maximization , 2012, TEAC.

[11]  David Sarne,et al.  The Choice of Eliminating the Uncertainty Cloud in Auctions , 2009, AMEC/TADA.

[12]  Theodore Groves,et al.  Incentives in Teams , 1973 .

[13]  Amos Azaria,et al.  Strategic Information Disclosure to People with Multiple Alternatives , 2011, AAAI.

[14]  Paul R. Milgrom,et al.  The value of information in a sealed-bid auction , 1982 .

[15]  Anthony J. Bagnall,et al.  Autonomous Adaptive Agents for Single Seller Sealed Bid Auctions , 2006, Autonomous Agents and Multi-Agent Systems.

[16]  Evangelos Markakis,et al.  Auction-Based Multi-Robot Routing , 2005, Robotics: Science and Systems.

[17]  Atsuko Miyaji,et al.  A Second-price Sealed-bid Auction with the Discriminant of the p0-th Root , 2002, Financial Cryptography.

[18]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[19]  E. Maasland,et al.  Auction Theory , 2021, Springer Texts in Business and Economics.

[20]  P. Reny,et al.  On the failure of the linkage principle in multi-unit auctions , 1999 .

[21]  Maja J. Mataric,et al.  Sold!: auction methods for multirobot coordination , 2002, IEEE Trans. Robotics Autom..

[22]  Daniel Quint,et al.  Looking smart versus playing dumb in common-value auctions , 2010 .

[23]  A. Miyaji,et al.  A Second-price Sealed-bid Auction with Veri able Discriminant of p0-th Root ? , 2002 .

[24]  R. Selten Reexamination of the perfectness concept for equilibrium points in extensive games , 1975, Classics in Game Theory.

[25]  J. Laffont Game Theory and Empirical Economics: The Case of Auction Data , 1997 .

[26]  D.C. Parkes,et al.  Distributed implementations of Vickrey-Clarke-Groves mechanisms , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[27]  Andrew B. Whinston,et al.  Buy-price English auction , 2006, J. Econ. Theory.

[28]  Sarit Kraus,et al.  Bidding in sealed-bid and English multi-attribute auctions , 2006, Decis. Support Syst..

[29]  T. Sandholm,et al.  Costly valuation computation in auctions , 2001 .

[30]  Noam Nisan,et al.  Competitive analysis of incentive compatible on-line auctions , 2000, EC '00.

[31]  Moshe Babaioff,et al.  Peaches, lemons, and cookies: designing auction markets with dispersed information , 2013, EC '13.

[32]  Paul R. Milgrom,et al.  A theory of auctions and competitive bidding , 1982 .

[33]  Paul R. Milgrom,et al.  Competitive Bidding and Proprietary Information , 1983 .

[34]  Moshe Tennenholtz,et al.  Optimal auctions revisited , 1998, Artif. Intell..

[35]  H. Hosam,et al.  Planning Coalition Formation under Uncertainty: Auction Approach , 2006, 2006 2nd International Conference on Information & Communication Technologies.

[36]  Noam Nisan,et al.  Algorithms for Selfish Agents , 1999, STACS.

[37]  David C. Parkes,et al.  An options-based solution to the sequential auction problem , 2009, Artif. Intell..

[38]  Ram Orzach,et al.  Equilibrium and revenue in a family of common-value first-price auctions with differential information , 2012, Int. J. Game Theory.

[39]  David C. Parkes,et al.  Optimal Auction Design for Agents with Hard Valuation Problems , 1999, Agent Mediated Electronic Commerce.

[40]  Lawrence M. Ausubel An Efficient Ascending-Bid Auction for Multiple Objects , 2004 .

[41]  Theo Offerman,et al.  Competitive Bidding in Auctions with Private and Common Values , 2000 .

[42]  M. Rothkopf A Model of Rational Competitive Bidding , 1969 .

[43]  Daniel Vanderpooten,et al.  Preference-based English reverse auctions , 2011, Artif. Intell..

[44]  D. Zizzo,et al.  Rational Expectations , 2006 .

[45]  Robert B. Wilson A Bidding Model of Perfect Competition , 1977 .

[46]  Boi Faltings,et al.  Market-Skilled Agents for Automating the Bandwidth Commerce , 2000, USM.

[47]  Dirk Bergemann,et al.  Information Acquisition in Interdependent Value Auctions , 2007 .

[48]  Peter Bro Miltersen,et al.  Send mixed signals: earn more, work less , 2012, EC '12.

[49]  Nir Vulkan,et al.  Introduction to The Economics of E-Commerce: A Strategic Guide to Understanding and Designing the Online Marketplace , 2003 .

[50]  M. Dufwenberg Game theory. , 2011, Wiley interdisciplinary reviews. Cognitive science.

[51]  Nicole Immorlica,et al.  Constrained signaling for welfare and revenue maximization , 2013, SECO.

[52]  Makoto Yokoo,et al.  Robust Combinatorial Auction Protocol against False-Name Bids , 2000, AAAI/IAAI.

[53]  Nicholas R. Jennings,et al.  Bidding strategies for realistic multi-unit sealed-bid auctions , 2008, Autonomous Agents and Multi-Agent Systems.

[54]  David C. Parkes,et al.  Chain: A Dynamic Double Auction Framework for Matching Patient Agents , 2007, J. Artif. Intell. Res..

[55]  R. Porter,et al.  An Empirical Study of an Auction with Asymmetric Information , 1988 .

[56]  P. Klemperer Auction Theory: A Guide to the Literature , 1999 .

[57]  P. Cramton The FCC Spectrum Auctions: An Early Assessment , 1997 .

[58]  David A. McAllester,et al.  Decision-Theoretic Bidding Based on Learned Density Models in Simultaneous, Interacting Auctions , 2003, J. Artif. Intell. Res..

[59]  Jacob K. Goeree,et al.  Quantal Response Equilibrium and Overbidding in Private-Value Auctions , 2002, J. Econ. Theory.

[60]  Ori Haimanko,et al.  Dominance solvability of second-price auctions with differential information , 2002 .

[61]  Paul Klemperer,et al.  Auctions: Theory and Practice , 2004 .

[62]  Mohammad Taghi Hajiaghayi,et al.  Online auctions with re-usable goods , 2005, EC '05.

[63]  John H. Kagel,et al.  Resolving Uncertainty about the Number of Bidders in Independent Private- Value Auctions: An Experimental Analysis , 1989 .

[64]  Moshe Tennenholtz,et al.  Tractable combinatorial auctions and b-matching , 2002, Artif. Intell..

[65]  R. Thaler Anomalies: The Winner's Curse , 1988 .

[66]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[67]  Sarit Kraus,et al.  Efficiently determining the appropriate mix of personal interaction and reputation information in partner choice , 2008, AAMAS.

[68]  Margo I. Seltzer,et al.  Virtual worlds: fast and strategyproof auctions for dynamic resource allocation , 2003, EC '03.

[69]  J. Goeree,et al.  Efficiency in auctions with Private and Common Values , 2002 .