Adversarial Constrained Bidding via Minimax Regret Optimization with Causality-Aware Reinforcement Learning-Reference-Cited by-同舟云学术

Adversarial Constrained Bidding via Minimax Regret Optimization with Causality-Aware Reinforcement Learning

Published:2023-08-04 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
language:
Short-container-title:

Author:

Wang Haozhe¹^ORCID,Du Chao¹^ORCID,Fang Panyan¹^ORCID,He LI¹^ORCID,Wang Liang¹^ORCID,Zheng Bo¹^ORCID

Affiliation:

1. Alibaba Group, Beijing, China

Publisher

ACM

Link

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

Reference48 articles.

1. Jonas Adler and Sebastian Lunz . 2018. Banach wasserstein gan. Advances in neural information processing systems 31 ( 2018 ). Jonas Adler and Sebastian Lunz. 2018. Banach wasserstein gan. Advances in neural information processing systems 31 (2018).

2. Alexander A Alemi , Ian Fischer , Joshua V Dillon , and Kevin Murphy . 2016. Deep variational information bottleneck. arXiv preprint arXiv:1612.00410 ( 2016 ). Alexander A Alemi, Ian Fischer, Joshua V Dillon, and Kevin Murphy. 2016. Deep variational information bottleneck. arXiv preprint arXiv:1612.00410 (2016).

3. Alimama 2022. Alimama. Retrieved 2022 from https://www.alimama.com/ Alimama 2022. Alimama. Retrieved 2022 from https://www.alimama.com/

4. David Balduzzi , Sebastien Racaniere , James Martens , Jakob Foerster , Karl Tuyls , and Thore Graepel . 2018 . The mechanics of n-player differentiable games . In International Conference on Machine Learning. PMLR, 354--363 . David Balduzzi, Sebastien Racaniere, James Martens, Jakob Foerster, Karl Tuyls, and Thore Graepel. 2018. The mechanics of n-player differentiable games. In International Conference on Machine Learning. PMLR, 354--363.

5. S. Balseiro A. Kim M. Mahdian and V. Mirrokni. 2021. Budget-Management Strategies in Repeated Auctions. Operations Research 69 3 (2021). S. Balseiro A. Kim M. Mahdian and V. Mirrokni. 2021. Budget-Management Strategies in Repeated Auctions. Operations Research 69 3 (2021).

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

1. Spending Programmed Bidding: Privacy-friendly Bid Optimization with ROI Constraint in Online Advertising;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24

2. FreQuant: A Reinforcement-Learning based Adaptive Portfolio Optimization with Multi-frequency Decomposition;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24

3. Bayesian reinforcement learning for navigation planning in unknown environments;Frontiers in Artificial Intelligence;2024-07-04