Showing 2024Show all
3 papers · 1 filter
cs.DS2024
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…
cs.DS2024
The Secretary Problem with Predicted Additive Gap
Alexander Braun, Sherry Sarkar
The secretary problem is one of the fundamental problems in online decision making; a tight competitive ratio for this problem of has been known since…
cs.DS2024
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…