5 citations · 6 across the 7 of their papers we have counts for
6 papers · 1 filter
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…
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…
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.…
The Online Submodular Assignment Problem
Daniel Hathcock, Billy Jin, Kalen Patton +2
Online resource allocation is a rich and varied field. One of the most well-known problems in this area is online bipartite matching, introduced in 1990 by Karp, Vazirani, and Vazi…
The Online Submodular Assignment Problem
Daniel Hathcock, Billy Jin, Kalen Patton +2
Online resource allocation is a rich and varied field. One of the most well-known problems in this area is online bipartite matching, introduced in 1990 by Karp, Vazirani, and Vazi…
Submodular Norms with Applications To Online Facility Location and Stochastic Probing
Kalen Patton, Matteo Russo, Sahil Singla
Optimization problems often involve vector norms, which has led to extensive research on developing algorithms that can handle objectives beyond the norms. Our work introd…