Online Bidding Algorithms for Return-on-Spend Constrained Advertisers

29 August 2022

Papers citing "Online Bidding Algorithms for Return-on-Spend Constrained Advertisers"

14 / 14 papers shown

Title
Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint Rahul Vaze Abhishek Sinha 63 0 0 08 Feb 2025
A Unifying Framework for Online Optimization with Long-Term Constraints Matteo Castiglioni A. Celli A. Marchesi Giulia Romano N. Gatti 41 35 0 15 Sep 2022
No-regret Learning in Repeated First-Price Auctions with Budget Constraints Rui Ai Chang Wang Chenchen Li Jinshan Zhang Wenhan Huang Xiaotie Deng 54 10 0 29 May 2022
Bidding Agent Design in the LinkedIn Ad Marketplace Yuan Gao Kaiyu Yang Yuanlong Chen Min Liu N. Karoui 47 11 0 25 Feb 2022
Learning to Bid in Contextual First Price Auctions Ashwinkumar Badanidiyuru Zhe Feng Guru Guruganesh 42 17 0 07 Sep 2021
Learning to Bid Optimally and Efficiently in Adversarial First-price Auctions Yanjun Han Zhengyuan Zhou Aaron Flores E. Ordentlich Tsachy Weissman 33 40 0 09 Jul 2020
Adversarial Bandits with Knapsacks Nicole Immorlica Karthik Abinav Sankararaman Robert Schapire Aleksandrs Slivkins 126 113 0 28 Nov 2018
Learning to Bid Without Knowing your Value Zhe Feng Chara Podimata Vasilis Syrgkanis 40 57 0 03 Nov 2017
Online Convex Optimization with Stochastic Constraints Hao Yu M. Neely Xiaohan Wei 63 223 0 12 Aug 2017
Online learning in repeated auctions Jonathan Niles-Weed Vianney Perchet Philippe Rigollet 37 90 0 18 Nov 2015
Fast Algorithms for Online Stochastic Convex Programming Shipra Agrawal Nikhil R. Devanur 116 172 0 28 Oct 2014
Using Optimization to Solve Positive LPs Faster in Parallel Zeyuan Allen-Zhu L. Orecchia 53 56 0 08 Jul 2014
Bandits with Knapsacks Ashwinkumar Badanidiyuru Robert D. Kleinberg Aleksandrs Slivkins 82 430 0 11 May 2013
Trading Regret for Efficiency: Online Convex Optimization with Long Term Constraints M. Mahdavi Rong Jin Tianbao Yang 162 264 0 25 Nov 2011