English
Related papers

Related papers: Robust Budget Pacing with a Single Sample

200 papers

Online ad platforms offer budget management tools for advertisers that aim to maximize the number of conversions given a budget constraint. As the volume of impressions, conversion rates and prices vary over time, these budget management…

Computer Science and Game Theory · Computer Science 2022-02-15 Bhuvesh Kumar , Jamie Morgenstern , Okke Schrijvers

In this paper, we analyze a natural learning algorithm for uniform pacing of advertising budgets, equipped to adapt to varying ad sale platform conditions. On the demand side, advertisers face a fundamental technical challenge in automating…

Computer Science and Game Theory · Computer Science 2022-11-14 MohammadTaghi Hajiaghayi , Max Springer

In online advertising markets, budget-constrained advertisers acquire ad placements through repeated bidding in auctions on various platforms. We present a strategy for bidding optimally in a set of auctions that may or may not be…

Computer Science and Game Theory · Computer Science 2023-06-14 Fransisca Susan , Negin Golrezaei , Okke Schrijvers

In modern advertising platforms, learning algorithms are deployed by budget-constrained bidders to maximize their accumulated value. These algorithms often offer classical utility guarantees like no-regret, i.e., the agent's utility is at…

Computer Science and Game Theory · Computer Science 2026-02-23 Giannis Fikioris , Robert Kleinberg , Yoav Kolumbus , Yishay Mansour , Eva Tardos

In targeted online advertising, advertisers look for maximizing campaign performance under delivery constraint within budget schedule. Most of the advertisers typically prefer to impose the delivery constraint to spend budget smoothly over…

Artificial Intelligence · Computer Science 2015-06-22 Jian Xu , Kuang-chih Lee , Wentong Li , Hang Qi , Quan Lu

Budget management strategies in repeated auctions have received growing attention in online advertising markets. However, previous work on budget management in online bidding mainly focused on second-price auctions. The rapid shift from…

Computer Science and Game Theory · Computer Science 2023-04-27 Qian Wang , Zongjun Yang , Xiaotie Deng , Yuqing Kong

Online Resource Allocation problem is a central problem in many areas of Computer Science, Operations Research, and Economics. In this problem, we sequentially receive $n$ stochastic requests for $m$ kinds of shared resources, where each…

Data Structures and Algorithms · Computer Science 2025-05-07 Rohan Ghuge , Sahil Singla , Yifan Wang

In this paper, we study the problem of estimating uniformly well the mean values of several distributions given a finite budget of samples. If the variance of the distributions were known, one could design an optimal sampling strategy by…

Machine Learning · Computer Science 2015-07-17 Alexandra Carpentier , Alessandro Lazaric , Mohammad Ghavamzadeh , Rémi Munos , Peter Auer , András Antos

Budget-management systems are one of the key components of modern auction markets. Internet advertising platforms typically offer advertisers the possibility to pace the rate at which their budget is depleted, through budget-pacing…

Computer Science and Game Theory · Computer Science 2021-06-18 Andrea Celli , Riccardo Colini-Baldeschi , Christian Kroer , Eric Sodomka

In today's online advertising markets, a crucial requirement for an advertiser is to control her total expenditure within a time horizon under some budget. Among various budget control methods, throttling has emerged as a popular choice,…

Computer Science and Game Theory · Computer Science 2023-12-14 Zhaohua Chen , Chang Wang , Qian Wang , Yuqi Pan , Zhuming Shi , Zheng Cai , Yukun Ren , Zhihua Zhu , Xiaotie Deng

We study online resource allocation under non-stationary demand with a minimum offline data requirement. In this problem, a decision-maker must allocate multiple types of resources to sequentially arriving queries over a finite horizon.…

Machine Learning · Computer Science 2026-02-23 Yiding Feng , Jiashuo Jiang , Yige Wang

In this paper, we study a problem of detecting the source of diffused information by querying individuals, given a sample snapshot of the information diffusion graph, where two queries are asked: {\em (i)} whether the respondent is the…

Social and Information Networks · Computer Science 2020-10-07 Jaeyoung Choi , Yung Yi

Budget pacing is a popular service that has been offered by major internet advertising platforms since their inception. Budget pacing systems seek to optimize advertiser returns subject to budget constraints by smoothly spending advertiser…

Computer Science and Game Theory · Computer Science 2023-12-18 Santiago R. Balseiro , Kshipra Bhawalkar , Zhe Feng , Haihao Lu , Vahab Mirrokni , Balasubramanian Sivan , Di Wang

In this paper, we study the problem of learning to bid in repeated first-price auctions with budget constraints. In each period, the decision maker needs to submit a bid to win the auction and maximize the total collected reward, subject to…

Optimization and Control · Mathematics 2026-03-10 Zeng Fu , Jiashuo Jiang , Yuan Zhou

Internet advertising is a sophisticated game in which the many advertisers "play" to optimize their return on investment. There are many "targets" for the advertisements, and each "target" has a collection of games with a potentially…

Computational Complexity · Computer Science 2015-03-13 Bhaskar DasGupta , S. Muthukrishnan

We study how a budget-constrained bidder should learn to adaptively bid in repeated first-price auctions to maximize her cumulative payoff. This problem arose due to an industry-wide shift from second-price auctions to first-price auctions…

Computer Science and Game Theory · Computer Science 2026-04-14 Yige Wang , Jiashuo Jiang

Budget pacing is critical in online advertising to align spend with campaign goals under dynamic auctions. Existing pacing methods often rely on ad-hoc parameter tuning, which can be unstable and inefficient. We propose a principled…

Machine Learning · Computer Science 2026-03-10 Sreeja Apparaju , Yichuan Niu , Xixi Qi

In the design and analysis of revenue-maximizing auctions, auction performance is typically measured with respect to a prior distribution over inputs. The most obvious source for such a distribution is past data. The goal is to understand…

Computer Science and Game Theory · Computer Science 2015-11-30 Richard Cole , Tim Roughgarden

Throttling is a popular method of budget management for online ad auctions in which the platform modulates the participation probability of an advertiser in order to smoothly spend her budget across many auctions. In this work, we…

Computer Science and Game Theory · Computer Science 2023-02-07 Xi Chen , Christian Kroer , Rachitesh Kumar

An unsupervised online streaming model is considered where samples arrive in an online fashion over $T$ slots. There are $M$ classifiers, whose confusion matrices are unknown a priori. In each slot, at most one sample can be labeled by any…

Machine Learning · Computer Science 2021-12-06 R. Vaze , Santanu Rathod
‹ Prev 1 2 3 10 Next ›