Better algorithms for unfair metrical task systems and applications
Amos Fiat, Manor Mendel

TL;DR
This paper introduces new techniques to improve randomized online algorithms for unfair metrical task systems, a generalization of traditional systems, by applying these methods to arbitrary metric spaces.
Contribution
The paper presents novel techniques for combining algorithms in unfair metrical task systems and achieves improved performance on arbitrary metric spaces.
Findings
Enhanced randomized algorithms for unfair metrical task systems.
Improved competitive ratios on arbitrary metric spaces.
New theoretical framework for combining algorithms.
Abstract
Unfair metrical task systems are a generalization of online metrical task systems. In this paper we introduce new techniques to combine algorithms for unfair metrical task systems and apply these techniques to obtain improved randomized online algorithms for metrical task systems on arbitrary metric spaces.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
