Image de couverture de livre

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

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Vaze, Rahul, Sinha, Abhishek
Format:	Preprint
Publié:	2025
Sujets:	Computer Science and Game Theory Data Structures and Algorithms Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

$O(\sqrt{T})$ Static Regret and Instance Dependent Constraint Violation for Constrained Online Convex Optimization
par: Vaze, Rahul, et autres
Publié: (2025)

Smooth Nash Equilibria: Algorithms and Complexity
par: Daskalakis, Constantinos, et autres
Publié: (2023)

Learning in Repeated Multi-Unit Pay-As-Bid Auctions
par: Galgana, Rigel, et autres
Publié: (2023)

Single-Sample and Robust Online Resource Allocation
par: Ghuge, Rohan, et autres
Publié: (2025)

Online Combinatorial Allocations and Auctions with Few Samples
par: Dütting, Paul, et autres
Publié: (2024)

Improved Algorithms for Contextual Dynamic Pricing
par: Tullii, Matilde, et autres
Publié: (2024)

Efficiency of Proportional Mechanisms in Online Auto-Bidding Advertising
par: Thang, Nguyen Kim
Publié: (2026)

Primal-Dual Algorithms with Predictions for Online Bounded Allocation and Ad-Auctions Problems
par: Kevi, Eniko, et autres
Publié: (2024)

Computing Optimal Regularizers for Online Linear Optimization
par: Gatmiry, Khashayar, et autres
Publié: (2024)

Choosing Behind the Veil: Tight Bounds for Identity-Blind Online Algorithms
par: Ezra, Tomer, et autres
Publié: (2024)

Online Algorithm for Fractional Matchings with Edge Arrivals in Graphs of Maximum Degree Three
par: Pashkovich, Kanstantsin, et autres
Publié: (2026)

Scheduling with Uncertain Holding Costs and its Application to Content Moderation
par: Gocmen, Caner, et autres
Publié: (2025)

Nash Incentive-compatible Online Mechanism Learning via Weakly Differentially Private Online Learning
par: Huh, Joon Suk, et autres
Publié: (2024)

High dimensional online calibration in polynomial time
par: Peng, Binghui
Publié: (2025)

Improved Regret and Contextual Linear Extension for Pandora's Box and Prophet Inequality
par: Liu, Junyan, et autres
Publié: (2025)

High-Dimensional Calibration from Swap Regret
par: Fishelson, Maxwell, et autres
Publié: (2025)

Fixed Point Computation: Beating Brute Force with Smoothed Analysis
par: Attias, Idan, et autres
Publié: (2025)

Simultaneous Swap Regret Minimization via KL-Calibration
par: Luo, Haipeng, et autres
Publié: (2025)

Collaborative Prediction: Tractable Information Aggregation via Agreement
par: Collina, Natalie, et autres
Publié: (2025)

Contextual Learning for Stochastic Optimization
par: Heuser, Anna, et autres
Publié: (2025)

Learning Optimal Posted Prices for a Unit-Demand Buyer
par: Teng, Yifeng, et autres
Publié: (2025)

Repeated Bilateral Trade Against a Smoothed Adversary
par: Cesa-Bianchi, Nicolò, et autres
Publié: (2023)

Repeated Contracting with Multiple Non-Myopic Agents: Policy Regret and Limited Liability
par: Collina, Natalie, et autres
Publié: (2024)

On the Learning Curves of Revenue Maximization
par: Hanneke, Steve, et autres
Publié: (2026)

An $α$-regret analysis of Adversarial Bilateral Trade
par: Azar, Yossi, et autres
Publié: (2022)

Bandit Sequential Posted Pricing via Half-Concavity
par: Singla, Sahil, et autres
Publié: (2023)

Strategizing against No-Regret Learners in First-Price Auctions
par: Rubinstein, Aviad, et autres
Publié: (2024)

The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations
par: Cesa-Bianchi, Nicolò, et autres
Publié: (2023)

Learning Safe Strategies for Value Maximizing Buyers in Uniform Price Auctions
par: Golrezaei, Negin, et autres
Publié: (2024)

Bandit Social Learning: Exploration under Myopic Behavior
par: Banihashem, Kiarash, et autres
Publié: (2023)

Water-Filling is Universally Minimax Optimal
par: Banerjee, Siddhartha, et autres
Publié: (2026)

Incentivizing Exploration with Selective Data Disclosure
par: Immorlica, Nicole, et autres
Publié: (2018)

Adaptive Discretization against an Adversary: Lipschitz bandits, Dynamic Pricing, and Auction Tuning
par: Podimata, Chara, et autres
Publié: (2020)

Procurement Auctions via Approximately Optimal Submodular Optimization
par: Deng, Yuan, et autres
Publié: (2024)

Learning in Stackelberg Games with Non-myopic Agents
par: Haghtalab, Nika, et autres
Publié: (2022)

Roping in Uncertainty: Robustness and Regularization in Markov Games
par: McMahan, Jeremy, et autres
Publié: (2024)

Tractable Agreement Protocols
par: Collina, Natalie, et autres
Publié: (2024)

Online Job Assignment
par: Ekbatani, Farbod, et autres
Publié: (2025)

Online Block Packing
par: Eliezer, Ariel Ben, et autres
Publié: (2025)

Online Matroid Embeddings
par: Cristi, Andrés, et autres
Publié: (2024)