Off-Policy Learning-to-Bid with AuctionGym-Reference-Cited by-同舟云学术

Off-Policy Learning-to-Bid with AuctionGym

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:

Jeunen Olivier¹^ORCID,Murphy Sean²^ORCID,Allison Ben²^ORCID

Affiliation:

1. ShareChat, Edinburgh, United Kingdom

2. Amazon, Edinburgh, United Kingdom

Publisher

ACM

Link

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

Reference54 articles.

1. P. Bajari B. Burdick G. W. Imbens L. Masoero J. McQueen T. Richardson and I. M. Rosen. 2021. Multiple Randomization Designs. https://arxiv.org/abs/2112.13495 P. Bajari B. Burdick G. W. Imbens L. Masoero J. McQueen T. Richardson and I. M. Rosen. 2021. Multiple Randomization Designs. https://arxiv.org/abs/2112.13495

2. W. Bendada , G. Salha , and T. Bontempelli . 2020 . Carousel Personalization in Music Streaming Apps with Contextual Bandits. In RecSys '20 . W. Bendada, G. Salha, and T. Bontempelli. 2020. Carousel Personalization in Music Streaming Apps with Contextual Bandits. In RecSys '20.

3. G. Brockman V. Cheung L. Pettersson J. Schneider J. Schulman J. Tang and W. Zaremba. 2016. OpenAI Gym. https://arxiv.org/abs/1606.01540 G. Brockman V. Cheung L. Pettersson J. Schneider J. Schulman J. Tang and W. Zaremba. 2016. OpenAI Gym. https://arxiv.org/abs/1606.01540

4. O. Chapelle and L. Li . 2011 . An Empirical Evaluation of Thompson Sampling. In NeurIPS '11 . O. Chapelle and L. Li. 2011. An Empirical Evaluation of Thompson Sampling. In NeurIPS '11.

5. M. Dudík , J. Langford , and L. Li . 2011 . Doubly Robust Policy Evaluation and Learning. In ICML '11 . M. Dudík, J. Langford, and L. Li. 2011. Doubly Robust Policy Evaluation and Learning. In ICML '11.

Cited by 5 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. Bidder Selection Problem in Position Auctions: A Fast and Simple Algorithm via Poisson Approximation;Proceedings of the ACM Web Conference 2024;2024-05-13

3. Practical Bandits: An Industry Perspective;Proceedings of the 17th ACM International Conference on Web Search and Data Mining;2024-03-04

4. Ad-load Balancing via Off-policy Learning in a Content Marketplace;Proceedings of the 17th ACM International Conference on Web Search and Data Mining;2024-03-04

5. Adversarial Constrained Bidding via Minimax Regret Optimization with Causality-Aware Reinforcement Learning;Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2023-08-04