ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2502.05599
  4. Cited By
Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint
v1v2 (latest)

Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint

8 February 2025
Rahul Vaze
Abhishek Sinha
ArXiv (abs)PDFHTML

Papers citing "Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint"

9 / 9 papers shown
Optimal Algorithms for Online Convex Optimization with Adversarial
  Constraints
Optimal Algorithms for Online Convex Optimization with Adversarial ConstraintsNeural Information Processing Systems (NeurIPS), 2023
Abhishek Sinha
Rahul Vaze
215
25
0
29 Oct 2023
A Unifying Framework for Online Optimization with Long-Term Constraints
A Unifying Framework for Online Optimization with Long-Term ConstraintsNeural Information Processing Systems (NeurIPS), 2022
Matteo Castiglioni
A. Celli
A. Marchesi
Giulia Romano
N. Gatti
175
48
0
15 Sep 2022
Online Bidding Algorithms for Return-on-Spend Constrained Advertisers
Online Bidding Algorithms for Return-on-Spend Constrained AdvertisersThe Web Conference (WWW), 2022
Zhe Feng
Swati Padmanabhan
Di Wang
371
34
0
29 Aug 2022
Adversarial Bandits with Knapsacks
Adversarial Bandits with Knapsacks
Nicole Immorlica
Karthik Abinav Sankararaman
Robert Schapire
Aleksandrs Slivkins
461
127
0
28 Nov 2018
Unifying the stochastic and the adversarial Bandits with Knapsack
Unifying the stochastic and the adversarial Bandits with Knapsack
A. Rangi
M. Franceschetti
Long Tran-Thanh
250
28
0
23 Oct 2018
The Online Saddle Point Problem and Online Convex Optimization with
  Knapsacks
The Online Saddle Point Problem and Online Convex Optimization with Knapsacks
Adrian Rivera Cardoso
He Wang
Huan Xu
219
16
0
21 Jun 2018
Online Convex Optimization with Stochastic Constraints
Online Convex Optimization with Stochastic ConstraintsNeural Information Processing Systems (NeurIPS), 2017
Hao Yu
M. Neely
Xiaohan Wei
165
244
0
12 Aug 2017
Fast Algorithms for Online Stochastic Convex Programming
Fast Algorithms for Online Stochastic Convex Programming
Shipra Agrawal
Nikhil R. Devanur
273
183
0
28 Oct 2014
Bandits with Knapsacks
Bandits with KnapsacksIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2013
Ashwinkumar Badanidiyuru
Robert D. Kleinberg
Aleksandrs Slivkins
1.2K
455
0
11 May 2013
1
Page 1 of 1