A Cooperative-Competitive Multi-Agent Framework for Auto-bidding in Online Advertising-Reference-Cited by-同舟云学术

A Cooperative-Competitive Multi-Agent Framework for Auto-bidding in Online Advertising

Published:2022-02-11 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining
language:
Short-container-title:

Author:

Wen Chao¹,Xu Miao²,Zhang Zhilin²,Zheng Zhenzhe³,Wang Yuhui⁴,Liu Xiangyu²,Rong Yu²,Xie Dong²,Tan Xiaoyang⁴,Yu Chuan²,Xu Jian²,Wu Fan³,Chen Guihai³,Zhu Xiaoqiang²,Zheng Bo²

Affiliation:

1. MIIT Key Laboratory of Pattern Analysis and Machine Intelligence & Alibaba Group, Nanjing, China

2. Alibaba Group, Beijing, China

3. Shanghai Jiao Tong University, Shanghai, China

4. MIIT Key Laboratory of Pattern Analysis and Machine Intelligence, Nanjing, China

Funder

National Science Foundation of China

Shanghai Science and Technology Fund

Alibaba Research Intern Program

Science and Technology Innovation 2030 ? New Generation Artificial Intelligence

Alibaba Innovation Research Program

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3488560.3498373

Reference34 articles.

1. Gagan Aggarwal , Ashwinkumar Badanidiyuru , and Aranyak Mehta . 2019. Autobidding with constraints . In WINE. Springer , 17--30. Gagan Aggarwal, Ashwinkumar Badanidiyuru, and Aranyak Mehta. 2019. Autobidding with constraints. In WINE. Springer, 17--30.

2. Han Cai Kan Ren Weinan Zhang Kleanthis Malialis Jun Wang Yong Yu and Defeng Guo. 2017. Real-time bidding by reinforcement learning in display advertising. In WSDM . 661--670. Han Cai Kan Ren Weinan Zhang Kleanthis Malialis Jun Wang Yong Yu and Defeng Guo. 2017. Real-time bidding by reinforcement learning in display advertising. In WSDM . 661--670.

3. Google Ads Help Center . 2021 . About automated bidding. https://support.google.com/google-ads/answer/2979071 . Accessed : January 24, 2021. Google Ads Help Center. 2021. About automated bidding. https://support.google.com/google-ads/answer/2979071 . Accessed: January 24, 2021.

4. Carl Davidson and Raymond Deneckere . 1986. Long-run competition in capacity, short-run competition in price, and the Cournot model. The Rand Journal of Economics ( 1986 ), 404--415. Carl Davidson and Raymond Deneckere. 1986. Long-run competition in capacity, short-run competition in price, and the Cournot model. The Rand Journal of Economics (1986), 404--415.

5. Paul Dütting Zhe Feng Harikrishna Narasimhan David Parkes and Sai Srivatsa Ravindranath. 2019. Optimal auctions through deep learning. In ICML. PMLR 1706--1715. Paul Dütting Zhe Feng Harikrishna Narasimhan David Parkes and Sai Srivatsa Ravindranath. 2019. Optimal auctions through deep learning. In ICML. PMLR 1706--1715.

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Survey on Bid Optimization in Real-Time Bidding Display Advertising;ACM Transactions on Knowledge Discovery from Data;2023-12-09

2. Research and applications of game intelligence;SCIENTIA SINICA Informationis;2023-10-01

3. Learning-Based Ad Auction Design with Externalities: The Framework and A Matching-Based Approach;Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2023-08-04

4. Playing Repeated Coopetitive Polymatrix Games with Small Manipulation Cost;Lecture Notes in Computer Science;2023

5. KRAF: A Flexible Advertising Framework using Knowledge Graph-Enriched Multi-Agent Reinforcement Learning;Proceedings of the 31st ACM International Conference on Information & Knowledge Management;2022-10-17