Relative Worst-Order Analysis: A Survey
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen

TL;DR
This paper surveys the relative worst-order analysis technique for evaluating online algorithms, highlighting key results and comparing it with other performance measures.
Contribution
It provides a comprehensive overview of the most important results in relative worst-order analysis and compares it with alternative evaluation methods.
Findings
Highlights key results in relative worst-order analysis
Compares this technique with other online algorithm measures
Provides insights into the strengths and limitations of the approach
Abstract
Relative worst-order analysis is a technique for assessing the relative quality of online algorithms. We survey the most important results obtained with this technique and compare it with other quality measures.
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.
