Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3292500.3330943acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article
Open access

Testing Dynamic Incentive Compatibility in Display Ad Auctions

Published: 25 July 2019 Publication History

Abstract

The question of transparency has become a key point of contention between buyers and sellers of display advertising space: ads are allocated via complex, black-box auction systems whose mechanics can be difficult to model let alone optimize against. Motivated by this concern, this paper takes the perspective of a single advertiser and develops statistical tests to confirm whether an underlying auction mechanism is dynamically incentive compatible (IC), so that truthful bidding in each individual auction and across time is an optimal strategy. The most general notion of dynamic-IC presumes that the seller knows how buyers discount future surplus, which is questionable in practice. We characterize dynamic mechanisms that are dynamic-IC for all possible discounting factors according to two intuitive conditions: the mechanism should be IC at each stage in the usual sense, and expected present utility (under truthful bidding) should be independent of past bids. The conditions motivate two separate experiments based on bid perturbations that can be run simultaneously on the same impression traffic. We provide a novel statistical test of stage-IC along with a test for utility-independence that can detect lags in how the seller uses past bid information. We evaluate our tests on display ad data from a major ad exchange and show how they can accurately uncover evidence of first- or second-price auctions coupled with dynamic reserve prices, among other types of dynamic mechanisms.

References

[1]
Kareem Amin, Afshin Rostamizadeh, and Umar Syed. 2013. Learning prices for repeated auctions with strategic buyers. In Advances in Neural Information Processing Systems (NIPS). 1169--1177.
[2]
Itai Ashlagi, Constantinos Daskalakis, and Nima Haghpanah. 2016. Sequential mechanisms with ex-post participation guarantees. In Proceedings of the 2016 ACM Conference on Economics and Computation (EC). ACM, 213--214.
[3]
Santiago Balseiro, Anthony Kim, Mohammad Mahdian, and Vahab Mirrokni. 2017. Budget management strategies in repeated auctions. In Proceedings of the 26th International Conference on the World Wide Web (WWW). 15--23.
[4]
Santiago R. Balseiro and Yonatan Gur. 2017. Learning in Repeated Auctions with Budgets: Regret Minimization and Equilibrium. In Proceedings of the 2017 ACM Conference on Economics and Computation (EC). ACM, 609--609.
[5]
Dirk Bergemann and Maher Said. 2010. Dynamic Auctions.
[6]
Dirk Bergemann and Juuso Valimaki. 2010. The dynamic pivot mechanism. Econometrica, Vol. 78, 2 (2010), 771--789.
[7]
Yuyu Chen. 2017. Programmatic advertising is preparing for the first-price auction era. https://digiday.com/marketing/programmatic- advertising-readying-first-price-auction-era. Accessed: 2018--11-04.
[8]
Benjamin Edelman and Michael Ostrovsky. 2007. Strategic bidder behavior in sponsored search auctions. Decision Support Systems, Vol. 43, 1 (2007), 192--198.
[9]
Benjamin Edelman, Michael Ostrovsky, and Michael Schwarz. 2007. Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords. American Economic Review, Vol. 97, 1 (2007), 242--259.
[10]
K. Ganchev, A. Kulesza, J. Tan, R. Gabbard, Q. Liu, and M. Kearns. 2007. Empirical Price Modeling for Sponsored Search. In Internet and Network Economics (WINE), Vol. 4858. Springer.
[11]
Sham M. Kakade, Ilan Lobel, and Hamid Nazerzadeh. 2013. Optimal dynamic mechanism design and the virtual-pivot mechanism. Operations Research, Vol. 61, 4 (2013), 837--854.
[12]
Yash Kanoria and Hamid Nazerzadeh. 2017. Dynamic reserve prices for repeated auctions: Learning from bids. (2017).
[13]
IAB Tech Lab. 2016. OpenRTB API Specification Version 2.5. www.iab.com/ wp-content/uploads/2016/03/OpenRTB-API-Specification-Version-2--5-FINAL.pdf. Accessed: 2018--11-04.
[14]
Sébastien Lahaie, Andrés Munoz Medina, Balasubramanian Sivan, and Sergei Vassilvitskii. 2018. Testing Incentive Compatibility in Display Ad Auctions. In Proceedings of the 2018 World Wide Web Conference (WWW). 1419--1428.
[15]
Andres M. Medina and Mehryar Mohri. 2014. Learning theory and algorithms for revenue optimization in second price auctions with reserve. In Proceedings of the 31st International Conference on Machine Learning (ICML-14). 262--270.
[16]
Vahab Mirrokni, Renato Paes Leme, Pingzhong Tang, and Song Zuo. 2016a. Dynamic Auctions with Bank Accounts. In IJCAI. 387--393.
[17]
Vahab Mirrokni, Renato Paes Leme, Pingzhong Tang, and Song Zuo. 2016b. Optimal dynamic mechanisms with ex-post IR via bank accounts. arXiv preprint arXiv:1605.08840 (2016).
[18]
Vahab Mirrokni, Renato Paes Leme, Rita Ren, and Song Zuo. 2018. Dynamic Mechanism Design in the Field. In Proceedings of the 2018 World Wide Web Conference (WWW). 1359--1368.
[19]
Vahab Mirrokni, Renato Paes Leme, Pingzhong Tang, and Song Zuo. 2018. Non-clairvoyant dynamic mechanism design. In Proceedings of the 2018 ACM Conference on Economics and Computation (EC). ACM, 169--169.
[20]
Roger B Myerson. 1981. Optimal auction design. Mathematics of Operations Research, Vol. 6, 1 (1981), 58--73.
[21]
Christos Papadimitriou, George Pierrakos, Alexandros Psomas, and Aviad Rubinstein. 2016. On the complexity of dynamic mechanism design. In Proceedings of the 27th annual Symposium on Discrete Algorithms (SODA). 1458--1475.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
KDD '19: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining
July 2019
3305 pages
ISBN:9781450362016
DOI:10.1145/3292500
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 July 2019

Check for updates

Author Tags

  1. display advertising
  2. dynamic mechanism
  3. hypothesis test
  4. incentive compatibility

Qualifiers

  • Research-article

Conference

KDD '19
Sponsor:

Acceptance Rates

KDD '19 Paper Acceptance Rate 110 of 1,200 submissions, 9%;
Overall Acceptance Rate 1,133 of 8,635 submissions, 13%

Upcoming Conference

KDD '25

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 723
    Total Downloads
  • Downloads (Last 12 months)118
  • Downloads (Last 6 weeks)17
Reflects downloads up to 25 Jan 2025

Other Metrics

Citations

Cited By

View all

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media