5 citations · 6 across the 7 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
cs.DS2025
Online Allocation with Concave, Diminishing-Returns Objectives
Kalen Patton
Online resource allocation problems are central challenges in economics and computer science, modeling situations in which items arriving one at a time must each be immediately…
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…
cs.DS2025
Online Combinatorial Optimization with Graphical Dependencies
Zhimeng Gao, Evangelia Gergatsouli, Kalen Patton +1
Most existing work in online stochastic combinatorial optimization assumes that inputs are drawn from independent distributions -- a strong assumption that often fails in practice.…