A Quasipolynomial Algorithm for $\ell_\infty$ Contractions

We give an algorithm for computing an $\eps$-approximate fixed point of any $d$-dimensional nonexpansion with respect to the $\ell_\infty$ norm in time $\log(1/\eps)^{O(\log^2 d)}$. At its core, our method uses a boosting argument to geometrically shrink a search region. Among other consequences, our algorithm implies that simple stochastic games can be solved in quasipolynomial time. --- Source: arXiv:2610.30122v1 - http://arxiv.org/abs/2610.30122v1 PDF: https://arxiv.org/pdf/2610.30122v1 Origi...