[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/3539597.3570381acmconferencesArticle/Chapter ViewAbstractPublication PageswsdmConference Proceedingsconference-collections
research-article

Boosting Advertising Space: Designing Ad Auctions for Augment Advertising

Published: 27 February 2023 Publication History

Abstract

In online e-commerce platforms, sponsored ads are always mixed with non-sponsored organic content (recommended items). To guarantee user experience, online platforms always impose strict limitations on the number of ads displayed, becoming the bottleneck for advertising revenue. To boost advertising space, we introduce a novel advertising business paradigm called Augment Advertising, where once a user clicks on a leading ad on the main page, instead of being shown the corresponding products, a collection of mini-detail ads relevant to the clicked ad is displayed. A key component for augment advertising is to design ad auctions to jointly select leading ads on the main page and mini-detail ads on the augment ad page. In this work, we decouple the ad auction into a two-stage auction, including a leading ad auction and a mini-detail ad auction. We design the Potential Generalized Second Price (PGSP) auction with Symmetric Nash Equilibrium (SNE) for leading ads, and adopt GSP auction for mini-detail ads. We have deployed augment advertising on Taobao advertising platform, and conducted extensive offline evaluations and online A/B tests. The evaluation results show that augment advertising could guarantee user experience while improving the ad revenue and the PGSP auction outperforms baselines in terms of revenue and user experience in augment advertising.

Supplementary Material

MP4 File (WSDM23-p0091.mp4)
Presentation Video

References

[1]
Yoram Bachrach, Sofia Ceppi, Ian A. Kash, Peter B. Key, and David Kurokawa. 2014. Optimising trade-offs among stakeholders in ad auctions. In Proceedings of EC. 75--92.
[2]
Dagui Chen, Qi Yan, Chunjie Chen, Zhenzhe Zheng, Yangsu Liu, Zhenjia Ma, Chuan Yu, Jian Xu, and Bo Zheng. 2022. Hierarchically Constrained Adaptive Ad Exposure in Feeds. In Proceedings of CIKM. 3003--3012.
[3]
Xiang Chen, Bowei Chen, and Mohan Kankanhalli. 2017. Optimizing Trade-Offs Among Stakeholders in Real-Time Bidding by Incorporating Multimedia Metrics. In Proceedings of SIGIR (Shinjuku, Tokyo, Japan). 205--214.
[4]
Nikhil R. Devanur and Sham M. Kakade. 2009. The price of truthfulness for pay-per-click auctions. In Proceedings of EC. 99--106.
[5]
Paul Dütting, Zhe Feng, Harikrishna Narasimhan, David C. Parkes, and Sai Srivatsa Ravindranath. 2019. Optimal Auctions through Deep Learning. In Proceedings of ICML. 1706--1715.
[6]
Paul Dü tting, Felix A. Fischer, and David C. Parkes. 2016. Truthful Outcomes from Non-Truthful Position Auctions. In Proceedings of EC. 813.
[7]
Benjamin Edelman, Michael Ostrovsky, and Michael Schwarz. 2007. Internet Advertising and the Generalized Second-Price Auction. American Economic Review, Vol. 97, 1 (March 2007), 242--259.
[8]
Jun Feng, Heng Li, Minlie Huang, Shichen Liu, Wenwu Ou, Zhirong Wang, and Xiaoyan Zhu. 2018. Learning to collaborate: Multi-scenario ranking via multi-agent reinforcement learning. In Proceedings of WWW. 1939--1948.
[9]
Jerome H. Friedman. 2001. Greedy function approximation: a gradient boosting machine. The Annals of Statistics, Vol. 29, 5 (2001).
[10]
Negin Golrezaei, Max Lin, Vahab Mirrokni, and Hamid Nazerzadeh. 2021. Boosted Second Price Auctions: Revenue Optimization for Heterogeneous Bidders. In Proceedings of SIGKDD. 447--457.
[11]
Jason D Hartline and Tim Roughgarden. 2009. Simple versus optimal mechanisms. In Proceedings of EC. 225--234.
[12]
Sébastien Lahaie and R. Preston McAfee. 2011. Efficient ranking in sponsored search. In Workshop on Internet and Network Economics (WINE). 254--265.
[13]
Guogang Liao, Xuejian Li, Ze Wang, Fan Yang, Muzhi Guan, Bingqi Zhu, Yongkang Wang, Xingxing Wang, and Dong Wang. 2022a. NMA: Neural Multi-slot Auctions with Externalities for Online Advertising. (2022). showeprint[arXiv]2205.10018
[14]
Guogang Liao, Ze Wang, Xiaoxu Wu, Xiaowen Shi, Chuheng Zhang, Yongkang Wang, Xingxing Wang, and Dong Wang. 2022b. Cross DQN: Cross Deep Q Network for Ads Allocation in Feed. In Proceedings of WWW. 401--409.
[15]
Xiangyu Liu, Chuan Yu, Zhilin Zhang, Zhenzhe Zheng, Yu Rong, Hongtao Lv, Da Huo, Yiqing Wang, Dagui Chen, Jian Xu, Fan Wu, Guihai Chen, and Xiaoqiang Zhu. 2021. Neural Auction: End-to-End Learning of Auction Mechanisms for E-Commerce Advertising. In Proceedings of SIGKDD. 3354--3364.
[16]
Noam Nisan, Tim Roughgarden, Eva Tardos, and Vijay V. Vazirani. 2007. Algorithmic Game Theory. Cambridge University Press, Cambridge.
[17]
Ben Roberts, Dinan Gunawardena, Ian A. Kash, and Peter B. Key. 2013. Ranking and tradeoffs in sponsored search auctions. In Proceedings of EC. 751--766.
[18]
Weiran Shen, Pingzhong Tang, and Song Zuo. 2019. Automated Mechanism Design via Neural Networks. In Proceedings of the AAMAS. 215--223.
[19]
David R.M. Thompson and Kevin Leyton-Brown. 2013. Revenue optimization in the generalized second-price auction. In Proceedings of EC. 837--852.
[20]
UNCTAD. 2021. Global e-commerce jumps to $26.7 trillion. https://unctad.org/news/global-e-commerce-jumps-267-trillion-covid-19-boosts-online-sales. Accessed: 2022--11-01.
[21]
Hal R Varian. 2007. Position auctions. international Journal of industrial Organization, Vol. 25, 6 (2007), 1163--1178.
[22]
Hal R. Varian and Christopher Harris. 2014. The VCG Auction in Theory and Practice. American Economic Review, Vol. 104, 5 (May 2014), 442--45.
[23]
Bo Wang, Zhaonan Li, Jie Tang, Kuo Zhang, Songcan Chen, and Liyun Ru. 2011. Learning to Advertise: How Many Ads Are Enough?. In Proceedings of PAKDD. 506--518.
[24]
Weixun Wang, Junqi Jin, Jianye Hao, Chunjie Chen, Chuan Yu, Weinan Zhang, Jun Wang, Xiaotian Hao, Yixi Wang, Han Li, Jian Xu, and Kun Gai. 2019. Learning Adaptive Display Exposure for Real-Time Advertising. In Proceedings of CIKM. 2595--2603.
[25]
Yiqing Wang, Xiangyu Liu, Zhenzhe Zheng, Zhilin Zhang, Miao Xu, Chuan Yu, and Fan Wu. 2022. On Designing a Two-Stage Auction for Online Advertising. In Proceedings of WWW. 90--99.
[26]
WARC. 2020. Brands to spend $59bn on e-commerce ads this year. https://www.warc.cn/newsandopinion/news/brands-to-spend-59bn-on-e-commerce-ads-this-year/44139. Accessed: 2022--11-01.
[27]
Christopher A. Wilkens, Ruggiero Cavallo, and Rad Niazadeh. 2017. GSP: The Cinderella of Mechanism Design. In Proceedings of WWW. 25--32.
[28]
Jinyun Yan, Zhiyuan Xu, Birjodh Tiwana, and Shaunak Chatterjee. 2020. Ads Allocation in Feed via Constrained Optimization. In Proceedings of SIGKDD. 3386--3394.
[29]
Weiru Zhang, Chao Wei, Xiaonan Meng, Yi Hu, and Hao Wang. 2018. The Whole-Page Optimization via Dynamic Ad Allocation. In Proceeding of WWW. 1407--1411.
[30]
Yusi Zhang, Zhi Yang, Liang Wang, and Li He. 2019. Autor3: Automated Real-time Ranking with Reinforcement Learning in E-commerce Sponsored Search Advertising. In Proceedings of CIKM. 2499--2507.
[31]
Zhilin Zhang, Xiangyu Liu, Zhenzhe Zheng, Chenrui Zhang, Miao Xu, Junwei Pan, Chuan Yu, Fan Wu, Jian Xu, and Kun Gai. 2021. Optimizing Multiple Performance Metrics with Deep GSP Auctions for E-commerce Advertising. In Proceedings of WSDM. 993--1001.
[32]
Jun Zhao, Guang Qiu, Ziyu Guan, Wei Zhao, and Xiaofei He. 2018. Deep Reinforcement Learning for Sponsored Search Real-time Bidding. In Proceedings of SIGKDD. 1021--1030.
[33]
Xiangyu Zhao, Changsheng Gu, Haoshenglun Zhang, Xiwang Yang, Xiaobing Liu, Jiliang Tang, and Hui Liu. 2021. DEAR : Deep Reinforcement Learning for Online Advertising Impression in Recommender Systems. In Proceedings of AAAI 2021. 750--758.
[34]
Xiangyu Zhao, Long Xia, Lixin Zou, Hui Liu, Dawei Yin, and Jiliang Tang. 2020a. Whole-Chain Recommendations. In Proceedings of CIKM. 1883--1891.
[35]
Xiangyu Zhao, Xudong Zheng, Xiwang Yang, Xiaobing Liu, and Jiliang Tang. 2020b. Jointly learning to recommend and advertise. In Proceedings of SIGKDD. 3319--3327.
[36]
Guorui Zhou, Na Mou, Ying Fan, Qi Pi, Weijie Bian, Chang Zhou, Xiaoqiang Zhu, and Kun Gai. 2019. Deep Interest Evolution Network for Click-Through Rate Prediction. In Proceedings of AAAI. 5941--5948.

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
WSDM '23: Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining
February 2023
1345 pages
ISBN:9781450394079
DOI:10.1145/3539597
Permission to make digital or hard copies of all or part 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 components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 February 2023

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. ad auction
  2. e-commerce advertising
  3. mechanism design

Qualifiers

  • Research-article

Funding Sources

Conference

WSDM '23

Acceptance Rates

Overall Acceptance Rate 498 of 2,863 submissions, 17%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 300
    Total Downloads
  • Downloads (Last 12 months)83
  • Downloads (Last 6 weeks)9
Reflects downloads up to 17 Jan 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media