Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2412.20711

Online Selfish Load Balancing

Wenqian Wang·Chenyang Xu·Yuhao Zhang
View original source ↗Read source document ↗Export metadata ↓

Abstract

In selfish load balancing, there is a set of machines and jobs to be scheduled, where each machine is owned by a selfish agent. Agents hold the processing times of jobs as private information and may strategically misreport them to maximize their utilities. The goal is to design a truthful mechanism that minimizes the makespan. This selfish-machine model was first proposed by Nisan and Ronen (STOC 1999), who presented an $m$-approximation algorithm for unrelated machines in the offline scenario, which was later shown to be tight by Christodoulou, Koutsoupias, and Kov\'acs (STOC 2023). The study of offline selfish load balancing on related machines was initiated by Archer and Tardos (FOCS 2001). The best-known results for this problem are two PTAS mechanisms, due to Christodoulou and Kov\'acs (SICOMP 2013) and Epstein, Levin and Stee (MOR 2016). However, there is little literature on selfish scheduling in the online scenario, which is precisely what arises in real-world applications (e.g., in cloud platforms, jobs arrive online). In this paper, we aim to address this gap. For unrelated machines, we observe that the existing $m$-approximation algorithm can also be implemented in an online scenario, implying that $m$ remains the best possible competitive ratio. For related machines, we design the first nontrivial online mechanism that is truthful in expectation and achieves a competitive ratio of $O(\log m)$. Moreover, we extend our mechanism to also guarantee job-side truthfulness (in expectation), ensuring that jobs arriving online report their true sizes. This notion was first studied by Feldman, Fiat, and Roytman (EC 2017), but without combining it with the classic machine-side truthfulness. Finally, we generalize our two-sided truthful mechanism to the $\ell_q$-norm variant of load balancing, achieving a competitive ratio of $\tilde{O}\left(m^{\frac{1}{q}(1-\frac{1}{q})}\right)$.

Explore related subjects

cs.DScs.GT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wenqian Wang, Chenyang Xu, Yuhao Zhang. 2024-12-30. Online Selfish Load Balancing. https://arxiv.org/abs/2412.20711

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↗