Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.16060

Online Submodular Welfare Maximization: Computation is not the Bottleneck

Rajan Udwani·David Wajc
View original source ↗Read source document ↗Export metadata ↓

Abstract

We revisit the online submodular welfare maximization problem (OSW), a vast generalization of numerous well-studied online allocation problems, including online bipartite matching, display ads and AdWords. A natural greedy OSW algorithm achieves a competitive ratio of $1/2$ [LLN06], and $1-1/e$ under i.i.d. arrivals [KPV13]. Both bounds are tight for polynomial-time algorithms unless NP=RP [KPV13]. The information-theoretic limits for OSW, in contrast, remained open. This prompted researchers to ask for tighter upper bounds [Mehta13] or conjecture the existence of better-competitive (slow) algorithms [Huang23, LTX+23, CHS24, Huang2024, HTW24}. We resolve Mehta's question and refute the subsequent conjectures, proving that the greedy algorithm is in fact tight for both adversarial and i.i.d. arrivals, regardless of computation time. Seemingly contradicting recent $(1-1/e)$-competitive fractional algorithms for OSW [HJP+24,Patton26], we show that this impossibility even holds for fractional algorithms, provided their outputs correspond to marginals that are roundable in hindsight. Conceptually, our proofs can be seen as identifying that a bottleneck for OSW, even under (deterministic) adversarial arrivals, is the inherently random notion of correlation gap [ADSY12].

Explore related subjects

cs.DSmath.OC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rajan Udwani, David Wajc. 2026-10-12. Online Submodular Welfare Maximization: Computation is not the Bottleneck. https://arxiv.org/abs/2610.16060

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

KEEP EXPLORING

Related papers

arXiv2026

Adding an Edge in a $P_4$-sparse Graph

For a graph family~${\cal F}$, the minimum ${\cal F}$-completion problem asks for the minimum number of non-edges to be added to a given graph~$G$ so that the resulting graph belongs to the family~${\cal F}$. This problem is NP-complete for many subclasses of perfect graphs, while polynomial solutions are available for minimal completion sets or restricted input. We study the minimum $P_4$-sparse completion problem that arises after adding a prescribed non-edge to a \(P_4\)-sparse graph \(G\), with the resulting graph required to remain \(P_4\)-sparse. For the case in which $G$ consists of two connected components, each containing one endpoint of the added non-edge, we characterize the possible forms of an optimal solution. Combining this characterization with the solution of the other cases identified by the structural decomposition of \(P_4\)-sparse graphs, we obtain an algorithm for the general problem that runs in $O(n^2)$ time and $O(n)$ space.

cs.DS↗
arXiv2026

Optimal Extrapolation Bounds for Sparse Fourier Sums

We prove a sharp extrapolation bound for $k$-sparse Fourier sums with arbitrary real frequencies and no separation assumption. For every $g(t)=\sum_{j=1}^k v_je^{iλ_jt}$ with $λ_j\in\mathbb{R}$ and every $x\geq 1$, \begin{align*} |g(x)|\le k\exp(O(k\operatorname{arcosh} x))\|g\|_{L^2[-1,1]}. \end{align*} Near the endpoint at $x=1+δ$, this gives an exponential factor of $\exp(O(k\sqrtδ))$, improving on the $\exp(O(k^2\log k\cdotδ))$ estimate of Chen and Price (ICALP 2019), and the exponent is optimal up to a constant factor. Our theorem has algorithmic applications to recovering gapless Fourier-sparse signals: it improves the resolution of cluster-location algorithms and the sample complexity of Fourier interpolation algorithms. In addition, it gives sharp bounds on the error transfer of sparse Fourier models just outside the training interval.

cs.DS↗
arXiv2026

Stochastic Network Speed Scaling with Competitive Ratios Independent of the Network

In network speed scaling, jobs arrive over time at a network of servers whose speeds can be tuned, every job must be processed by the servers along one of its allowed routes, and the goal is to minimize the total flow time plus the total energy. For stochastic arrivals, the competitive ratio of Vaze and Nair depends on the network, through the lengths of the routes it uses. We show that this dependence can be removed: we give an algorithm, which routes the jobs by solving a convex program and runs every server at a fixed speed, whose competitive ratio depends only on the power functions; for $P(s)=s^2$, it is at most the golden ratio $φ\approx1.618$. The key idea is a lower bound on the optimal cost which, like the cost of our algorithm, is a sum over the servers of a function of each server's load, so the analysis reduces to a single server. We also show that the routing rule of Vaze and Nair can be a factor $Ω(L)$ away from optimal, where $L$ is the length of the longest route.

cs.DS↗