1 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.GT2025
A few good choices
Thanh Nguyen, Haoyu Song, Young-San Lin
A Condorcet winning set addresses the Condorcet paradox by selecting a few candidates--rather than a single winner--such that no unselected alternative is preferred to all of them…
cs.DS2024★ 1 cited
Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems
Elena Grigorescu, Young-San Lin, Maoyuan Song
Learning-augmented algorithms have been extensively studied across the computer science community in the recent years, driven by advances in machine learning predictors, which can…
cs.DS2024★ 1 cited
A Simple Learning-Augmented Algorithm for Online Packing with Concave Objectives
Elena Grigorescu, Young-San Lin, Maoyuan Song
Learning-augmented algorithms has been extensively studied recently in the computer-science community, due to the potential of using machine learning predictions in order to improv…