Probabilistic alternatives for competitive analysis

Please always quote using this URN: urn:nbn:de:0297-zib-15131
  • In the last 20 years competitive analysis has become the main tool for analyzing the quality of online algorithms. Despite of this, competitive analysis has also been criticized: It sometimes cannot discriminate between algorithms that exhibit significantly different empirical behavior, or it even favors an algorithm that is worse from an empirical point of view. Therefore, there have been several approaches to circumvent these drawbacks. In this survey, we discuss probabilistic alternatives for competitive analysis.

Download full text files

Export metadata

Author:Benjamin HillerORCiD, Tjark Vredeveld
Document Type:ZIB-Report
Tag:competitive analysis; online algorithms; probabilistic analysis; survey
MSC-Classification:68-XX COMPUTER SCIENCE (For papers involving machine computations and programs in a specific mathematical area, see Section -04 in that area)
CCS-Classification:G. Mathematics of Computing
Date of first Publication:2012/04/19
Series (Serial Number):ZIB-Report (11-55)
Published in:Appeared In: Computer Science - Research and Development August 2012, Volume 27, Issue 3, pp 189-196
Licence (German):License LogoCreative Commons - Namensnennung-Nicht kommerziell-Keine Bearbeitung