ResearchTrend.AI
Online Ad Procurement in Non-stationary Autobidding Worlds

Online Ad Procurement in Non-stationary Autobidding Worlds

Jason Cheuk Nam Liang
Haihao Lu
Baoyu Zhou
ArXiv (abs)PDFHTML

Papers citing "Online Ad Procurement in Non-stationary Autobidding Worlds"

5 / 5 papers shown
Title
The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems
The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems
S. Balseiro
Haihao Lu
Vahab Mirrokni
91
108
0
18 Nov 2020
Learning Product Rankings Robust to Fake Users
Learning Product Rankings Robust to Fake Users
Negin Golrezaei
Vahideh H. Manshadi
Jon Schneider
S. Sekar
55
26
0
10 Sep 2020
Online convex optimization for cumulative constraints
Online convex optimization for cumulative constraints
Jianjun Yuan
Andrew G. Lamperski
67
113
0
19 Feb 2018
Bandits with Knapsacks
Bandits with Knapsacks
Ashwinkumar Badanidiyuru
Robert D. Kleinberg
Aleksandrs Slivkins
143
433
0
11 May 2013
Dynamic Pricing with Limited Supply
Dynamic Pricing with Limited Supply
Moshe Babaioff
S. Dughmi
Robert D. Kleinberg
Aleksandrs Slivkins
135
164
0
20 Aug 2011

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.