Learning to Bid Without Knowing your Value-Reference-Cited by-同舟云学术

Learning to Bid Without Knowing your Value

Published:2018-06-11 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2018 ACM Conference on Economics and Computation
language:
Short-container-title:

Author:

Feng Zhe¹,Podimata Chara¹,Syrgkanis Vasilis²

Affiliation:

1. Harvard University, Cambridge, MA, USA

2. Microsoft Research, Cambridge, MA, USA

Publisher

ACM

Link

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

Reference43 articles.

1. Mean Field Equilibrium in Dynamic Games with Strategic Complementarities

2. Alekh Agarwal Daniel Hsu Satyen Kale John Langford Lihong Li and Robert Schapire. 2014. Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits Proceedings of the 31st International Conference on Machine Learning (Proceedings of Machine Learning Research) Eric P. Xing and Tony Jebara (Eds.) Vol. Vol. 32. PMLR Bejing China 1638--1646. Alekh Agarwal Daniel Hsu Satyen Kale John Langford Lihong Li and Robert Schapire. 2014. Taming the Monster: A Fast and Simple Algorithm for Contextual Bandits Proceedings of the 31st International Conference on Machine Learning (Proceedings of Machine Learning Research) Eric P. Xing and Tony Jebara (Eds.) Vol. Vol. 32. PMLR Bejing China 1638--1646.

3. Noga Alon Nicolo Cesa-Bianchi Ofer Dekel and Tomer Koren. 2015. Online learning with feedback graphs: Beyond bandits Conference on Learning Theory. 23--35. Noga Alon Nicolo Cesa-Bianchi Ofer Dekel and Tomer Koren. 2015. Online learning with feedback graphs: Beyond bandits Conference on Learning Theory. 23--35.

4. Noga Alon Nicolo Cesa-bianchi Claudio Gentile and Yishay Mansour. 2013. From Bandits to Experts: A Tale of Domination and Independence. Advances in Neural Information Processing Systems 26 C.j.c. Burges L. Bottou M. Welling Z. Ghahramani and K.q. Weinberger (Eds.). 1610--1618. Noga Alon Nicolo Cesa-bianchi Claudio Gentile and Yishay Mansour. 2013. From Bandits to Experts: A Tale of Domination and Independence. Advances in Neural Information Processing Systems 26 C.j.c. Burges L. Bottou M. Welling Z. Ghahramani and K.q. Weinberger (Eds.). 1610--1618.

5. Kareem Amin Rachel Cummings Lili Dworkin Michael Kearns and Aaron Roth. 2015. Online Learning and Profit Maximization from Revealed Preferences. AAAI. 770--776. Kareem Amin Rachel Cummings Lili Dworkin Michael Kearns and Aaron Roth. 2015. Online Learning and Profit Maximization from Revealed Preferences. AAAI. 770--776.

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

1. Offline Reinforcement Learning for Optimizing Production Bidding Policies;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24

2. Online Causal Inference for Advertising in Real-Time Bidding Auctions;Marketing Science;2024-08-14

3. Optimal No-Regret Learning in Repeated First-Price Auctions;Operations Research;2024-07-08

4. The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

5. Keyword-Level Bayesian Online Bid Optimization for Sponsored Search Advertising;Operations Research Forum;2024-05-22