On-line balancing of random inputs

From MaRDI portal
Publication:3386519

DOI10.1002/RSA.20955zbMATH Open1454.91051arXiv1903.06898OpenAlexW3080328610MaRDI QIDQ3386519FDOQ3386519


Authors: N. Bansal, Joel Spencer Edit this on Wikidata


Publication date: 5 January 2021

Published in: Random Structures \& Algorithms (Search for Journal in Brave)

Abstract: We consider an online vector balancing game where vectors vt, chosen uniformly at random in 1,+1n, arrive over time and a sign xtin1,+1 must be picked immediately upon the arrival of vt. The goal is to minimize the Linfty norm of the signed sum sumtxtvt. We give an online strategy for picking the signs xt that has value O(n1/2) with high probability. Up to constants, this is the best possible even when the vectors are given in advance.


Full work available at URL: https://arxiv.org/abs/1903.06898




Recommendations




Cites Work


Cited In (8)





This page was built for publication: On-line balancing of random inputs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3386519)