Capacity as a Fundamental Metric for Mechanism Design in the Information Economy

Department of Electrical Engineering, University of California, Los Angeles, CA 90095.{sudhir,vwani} @ ee.ucla.eduAbstract. The auction theory literature has so far focused mostly on the designof mechanisms that takes the revenue or the efficiency as a yar dstick. However,scenarios where the capacity, which we define as “the number of bidders theauctioneer wants to have a positive probability of getting the item” , is a fun-damental concern are ubiquitous in the information economy. For instance, insponsored search auctions (SSA’s) or in online ad-exchanges, the true value ofan ad-slot for an advertiser is inherently derived from the conversion-rate, whichin turn depends on whether the advertiser actually obtained the ad-slot or not;thus, unless the capacity of the underlying auction is large, key parameters, suchas true valuations and advertiser-specific conversion rates, will remain unknownor uncertain leading to inherent inefficiencies in the syste m. In general, the sameholds true for all information goods/digital goods. We initiate a study of mecha-nisms, which take capacity as a yardstick, in addition to revenue/efficiency. Weshow that in the case of a single indivisible item one simple way to incorporatecapacity constraints is via designing mechanisms to sell probability distributions,and that under certain conditions, such optimal probability distributions couldbe identified using a Linear programming approach. We define a quantity calledprice of capacity to capture the tradeoff between capacity and revenue/effici ency.We also study the case of sponsored search auctions. Finally, we discuss how gen-eral such an approach via probability spikes can be made, and potential directionsfor future investigations.

[1]  Paul Milgrom,et al.  Putting Auction Theory to Work , 2004 .

[2]  Andrew V. Goldberg,et al.  Competitive auctions and digital goods , 2001, SODA '01.

[3]  P. Nelson Information and Consumer Behavior , 1970, Journal of Political Economy.

[4]  D. Parkes,et al.  Auctions, Bidding and Exchange Design , 2004 .

[5]  Sandeep Pandey,et al.  Handling Advertisements of Unknown Quality in Search Advertising , 2006, NIPS.

[6]  Yoav Shoham,et al.  Combinatorial Auctions , 2005, Encyclopedia of Wireless Networks.

[7]  Vwani P. Roychowdhury,et al.  Diversification in the internet economy: the role of for-profit mediators , 2007, SECO.

[8]  D. Gale,et al.  Multi-Item Auctions , 1986, Journal of Political Economy.

[9]  Aranyak Mehta,et al.  AdWords and Generalized On-line Matching , 2005, FOCS.

[10]  Vwani P. Roychowdhury,et al.  Capacity Constraints and the Inevitability of Mediators in Adword Auctions , 2007, WINE.

[11]  David M. Pennock,et al.  Revenue analysis of a family of ranking rules for keyword auctions , 2007, EC '07.

[12]  Aranyak Mehta,et al.  AdWords and generalized on-line matching , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[13]  A. Tversky,et al.  Loss Aversion in Riskless Choice: A Reference-Dependent Model , 1991 .

[14]  Vwani P. Roychowdhury,et al.  Exploration via design and the cost of uncertainty in keyword auctions , 2007, ArXiv.

[15]  Tilman Börgers,et al.  Equilibrium Bids in Sponsored Search Auctions: Theory and Evidence , 2013 .

[16]  John J. McCall,et al.  Information Economics , 2022, Management.

[17]  Anna R. Karlin,et al.  Competitive auctions , 2006, Games Econ. Behav..

[18]  Sébastien Lahaie,et al.  An analysis of alternative slot auction designs for sponsored search , 2006, EC '06.

[19]  John Langford,et al.  Maintaining Equilibria During Exploration in Sponsored Search Auctions , 2010, Algorithmica.

[20]  L. Shapley,et al.  The assignment game I: The core , 1971 .

[21]  Hal R. Varian,et al.  Information rules - a strategic guide to the network economy , 1999 .

[22]  Joseph M. Ostroy,et al.  From the Assignment Model to Combinatorial Auctions , 2003 .

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

[24]  Ashish Goel,et al.  Truthful auctions for pricing search keywords , 2006, EC '06.