On-Line Balancing of Random Inputs

by   Nikhil Bansal, et al.
NYU college

We consider an online vector balancing game where vectors v_t, chosen uniformly at random in {-1,+1}^n, arrive over time and a sign x_t ∈{-1,+1} must be picked immediately upon the arrival of v_t. The goal is to minimize the L^∞ norm of the signed sum ∑_t x_t v_t. We give an online strategy for picking the signs x_t that has value O(n^1/2) with high probability. Up to constants, this is the best possible even when the vectors are given in advance.


page 1

page 2

page 3

page 4


Online Vector Balancing and Geometric Discrepancy

We consider an online vector balancing question where T vectors, chosen ...

Online Discrepancy Minimization for Stochastic Arrivals

In the stochastic online vector balancing problem, vectors v_1,v_2,…,v_T...

Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing

A well-known result of Banaszczyk in discrepancy theory concerns the pre...

Optimal Online Discrepancy Minimization

We prove that there exists an online algorithm that for any sequence of ...

Hardness Results for Minimizing the Covariance of Randomly Signed Sum of Vectors

Given vectors 𝕧_1, …, 𝕧_n ∈ℝ^d with Euclidean norm at most 1 and 𝕩_0 ∈ [...

Online Discrepancy with Recourse for Vectors and Graphs

The vector-balancing problem is a fundamental problem in discrepancy the...

Balancing Cooperativeness and Adaptiveness in the (Noisy) Iterated Prisoner's Dilemma

Ever since Axelrod's seminal work, tournaments served as the main benchm...

Please sign up or login with your details

Forgot password? Click here to reset