2 papers
cs.LG2026
Online Algorithms via Minimax and Posterior Matching
Thomas Kesselheim, Marco Molinaro, Kalen Patton +1
Competitive analysis is central to the study of online algorithms, but upper bounds are often highly problem-specific. We develop a more unifying methodology via the minimax viewpo…
cs.DS2025
Integral Online Algorithms for Set Cover and Load Balancing with Convex Objectives
Thomas Kesselheim, Marco Molinaro, Kalen Patton +1
Online Set Cover and Load Balancing are central problems in online optimization, and there is a long line of work on developing algorithms for these problems with convex objectives…