Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2107.10777

Towards a Practical, Budget-Oblivious Algorithm for the Adwords Problem under Small Bids

Vijay V. Vazirani
View original source ↗Read source document ↗Export metadata ↓

Abstract

Motivated by recent insights into the online bipartite matching problem (\textsc{OBM}), our goal was to extend the optimal algorithm for it, namely \textsc{Ranking}, all the way to the special case of adwords problem, called \textsc{Small}, in which bids are small compared to budgets; the latter has been of considerable practical significance in ad auctions \cite{MSVV}. The attractive feature of our approach was that it would yield a {\em budget-oblivious algorithm}, i.e., the algorithm would not need to know budgets of advertisers and therefore could be used in autobidding platforms. We were successful in obtaining an optimal, budget-oblivious algorithm for \textsc{Single-Valued}, under which each advertiser can make bids of one value only. However, our next extension, to \textsc{Small}, failed because of a fundamental reason, namely failure of the {\em No-Surpassing Property}. Since the probabilistic ideas underlying our algorithm are quite substantial, we have stated them formally, after assuming the No-Surpassing Property, and we leave the open problem of removing this assumption. With the help of two undergrads, we conducted extensive experiments on our algorithm on randomly generated instances. Our findings are that the No-Surpassing Property fails less than $2\%$ of the time and that the performance of our algorithms for \textsc{Single-Valued} and \textsc{Small} are comparable to that of \cite{MSVV}. If further experiments confirm this, our algorithm may be useful as such in practice, especially because of its budget-obliviousness.

Explore related subjects

cs.DScs.DMcs.GTmath.COmath.PR

Keep this discovery

BibTeXRIS

Vijay V. Vazirani. 2021-07-22. Towards a Practical, Budget-Oblivious Algorithm for the Adwords Problem under Small Bids. https://arxiv.org/abs/2107.10777

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗
arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗