3 papers
cs.GT2026
Learning Unanimously Acceptable Lotteries via Queries
Davin Choo, Paul W. Goldberg, Nicholas Teh
Many high-stakes AI deployments proceed only if every stakeholder deems the system acceptable relative to their own minimum standard. With randomization over a finite menu of optio…
cs.DS2025
Learning-Augmented Online Bipartite Fractional Matching
Davin Choo, Billy Jin, Yongho Shin
Online bipartite matching is a fundamental problem in online optimization, extensively studied both in its integral and fractional forms due to its theoretical significance and pra…
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…