ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2307.05698
  4. Cited By
Online Ad Procurement in Non-stationary Autobidding Worlds

Online Ad Procurement in Non-stationary Autobidding Worlds

10 July 2023
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
94
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
1