10 citations · 29 across the 15 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.DS2024
A short note about the learning-augmented secretary problem
Davin Choo, Chun Kai Ling
We consider the secretary problem through the lens of learning-augmented algorithms. As it is known that the best possible expected competitive ratio is in the classic settin…
cs.LG2024
Online bipartite matching with imperfect advice
Davin Choo, Themis Gouleakis, Chun Kai Ling +1
We study the problem of online unweighted bipartite matching with offline vertices and online vertices where one wishes to be competitive against the optimal offline algori…