Online Competitive Analysis
Online Competitive Analysis is a theoretical framework in algorithm design that evaluates the performance of online algorithms by comparing their solution quality to that of an optimal offline algorithm under worst-case scenarios, distinguishing it from probabilistic or average-case analysis methods.
27
Publications
936
Citations
58
Authors
27
Institutions
Publications per year
2017–2026
5
Parents
27
Christos H. Papadimitriou · SIAM Journal on Computing · 2000 · 179 citations
Allocating online advertisement space with unreliable estimates
Mohammad Mahdian, Hamid Nazerzadeh, Amin Saberi · 2007 · 132 citations
Business, Marketing, Advertising +11
Ηλίας Κουτσουπιάς, Christos H. Papadimitriou · 1994 · 96 citations
Competitive Analysis via Regularization
Niv Buchbinder, Shahar Chen, Joseph Naor · 2013 · 53 citations
1–5 of 27
58
3
h-index
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 58
27
Technische Universität Berlin
Berlin, Germany
4 h-index
13 publications
249 citations
Technion – Israel Institute of Technology
Haifa, Israel
2 h-index
3 publications
53 citations

University of Southern Denmark
Odense, Denmark
2 h-index
4 publications
82 citations
Hebrew University of Jerusalem
Jerusalem, Israel
2 h-index
4 publications
138 citations

University of Wrocław
Wroclaw, Poland
2 h-index
2 publications
45 citations
University of California San Diego
San Diego, United States
2 h-index
2 publications
275 citations

University of Toronto
Toronto, Canada
2 h-index
3 publications
68 citations

Sapienza University of Rome
Rome, Italy
2 h-index
5 publications
77 citations
1–8 of 27
TALG · 2 publications · 49 citations
2
h-index
1 publications · 10 citations
1
h-index
Repository · 1 publications · 17 citations
1
h-index
IJFCS · 1 publications · 20 citations
1
h-index
JIMO · 1 publications · 14 citations
1
h-index
1–5