all AI news
No-Regret Algorithms in non-Truthful Auctions with Budget and ROI Constraints
April 16, 2024, 4:44 a.m. | Gagan Aggarwal, Giannis Fikioris, Mingfei Zhao
cs.LG updates on arXiv.org arxiv.org
Abstract: Advertisers increasingly use automated bidding to optimize their ad campaigns on online advertising platforms. Autobidding optimizes an advertiser's objective subject to various constraints, e.g. average ROI and budget constraints. In this paper, we study the problem of designing online autobidding algorithms to optimize value subject to ROI and budget constraints when the platform is running any mixture of first and second price auction.
We consider the following stochastic setting: There is an item for sale …
abstract ad campaigns advertisers advertising algorithms arxiv automated bidding budget campaigns constraints cs.gt cs.lg designing online advertising paper platforms roi study type value
More from arxiv.org / cs.LG updates on arXiv.org
Jobs in AI, ML, Big Data
AI Research Scientist
@ Vara | Berlin, Germany and Remote
Data Architect
@ University of Texas at Austin | Austin, TX
Data ETL Engineer
@ University of Texas at Austin | Austin, TX
Lead GNSS Data Scientist
@ Lurra Systems | Melbourne
Senior Machine Learning Engineer (MLOps)
@ Promaton | Remote, Europe
Business Data Analyst
@ Alstom | Johannesburg, GT, ZA