Subgame Optimal and Prior-Independent Online Algorithms (2403.10451v1)
Abstract: This paper takes a game theoretic approach to the design and analysis of online algorithms and illustrates the approach on the finite-horizon ski-rental problem. This approach allows beyond worst-case analysis of online algorithms. First, we define "subgame optimality" which is stronger than worst case optimality in that it requires the algorithm to take advantage of an adversary not playing a worst case input. Algorithms only focusing on the worst case can be far from subgame optimal. Second, we consider prior-independent design and analysis of online algorithms, where rather than choosing a worst case input, the adversary chooses a worst case independent and identical distribution over inputs. Prior-independent online algorithms are generally analytically intractable; instead we give a fully polynomial time approximation scheme to compute them. Highlighting the potential improvement from these paradigms for the finite-horizon ski-rental problem, we empirically compare worst-case, subgame optimal, and prior-independent algorithms in the prior-independent framework.
- Online Learning and Solving Infinite Games with an ERM oracle. Proceedings of the Thirty-Sixth Annual Conference on Learning Theory.
- Online Computation and Competitive Analysis. Cambridge University Press, USA.
- Dantzig, G. B. (1963). Linear programming and extensions. Princeton University Press.
- Near-optimal no-regret algorithms for zero-sum games. In Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’11, page 235–254, USA. Society for Industrial and Applied Mathematics.
- Stochastic k-server : How should uber work. 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Editors: Ioannis Chatzigiannakis, Piotr Indyk, Fabian Kuhn, and Anca Muscholl; Article No. 126; pp. 126:1–126:14.
- Learning online algorithms with distributional advice. ICML.
- A decision-theoretic generalization of online-learning and an application to boosting. J. Comput. Syst. Sci., 55:119–139.
- Adaptive game playing using multiplicative weights. 29(1-2):79–103.
- Algorithmic robust forecast aggregation.
- Benchmark design and prior-independent optimization. 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 294-305.
- Lower bounds for prior independent algorithms. CoRR, abs/2107.04754.
- Optimal mechanism design and money burning. In Proceedings of the fortieth annual ACM symposium on Theory of computing, pages 75–84.
- Solving zero-sum games using best-response oracles with applications to search games.
- Competitive randomized algorithms for non-uniform problems. Algorithmica, 11(6):542–571.
- Khachiyan, G. L. (1979). A polynomial time algorithm in linear programming. Soviet Mathematics Doklady, 20(1):191194.
- Beyond competitive analysis. Proceedings of the Conference on Foundations of Computer Science (FOCS). IEEE, 394–400.
- The semi-stochastic ski-rental problem. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011), 13:300–311.
- Online optimization with uncertain information. ACM Trans. Algorithms, 8(1).
- Roughgarden, T. (2020). Beyond the worst-case analysis of algorithms(introduction). arXiv preprint arXiv:2007.13241, 2020.
- von Neumann, J. (1928). Zur theorie der gesellschaftsspiele. Math. Ann. 100, 295-320.