Oct 2, 2019 · We show that the discrepancy of the above problem is sub-polynomial in n and that no algorithm can achieve a constant discrepancy.

Online Geometric Discrepancy for Stochastic Arrivals with Applications to Envy Minimization · Haotian Jiang, Janardhan Kulkarni, Sahil Singla · Published in arXiv ...

We define \emph{discrepancy} as the largest imbalance of any interval during the entire process. If all the arriving points were known upfront then we can color ...

Oct 2, 2019 · Abstract. Consider a unit interval [0, 1] in which n points arrive one-by-one independently and uniformly at random. On arrival of a point, ...

Our key idea is to introduce a potential that also enforces constraints on how the discrepancy vector evolves, allowing us to maintain certain anti- ...

Online Geometric Discrepancy for Stochastic. Arrivals with Applications to Envy Minimization. arXiv:1910.01073, 2019. [LM15] Shachar Lovett and Raghu Meka ...

Oct 4, 2019 · Bibliographic details on Online Geometric Discrepancy for Stochastic Arrivals with Applications to Envy Minimization.

Mar 21, 2021 · Our key idea is to introduce a potential that also enforces constraints on how the discrepancy vector evolves, allowing us to maintain certain ...

Online Geometric Discrepancy for Stochastic Arrivals with Applications to Envy Minimization. Jan 2019. Haotian Jiang; Janardhan Kulkarni; Sahil Singla. Haotian ...

Jul 21, 2020 · Online Geometric Discrepancy for Stochastic Arrivals with Applications to Envy Minimization · Mathematics, Computer Science. ArXiv · 2019.