3 papers
cs.GT2026
Approximate Proportionality in Online Fair Division
Davin Choo, Winston Fu, Derek Khu +3
We study the online fair division problem, where indivisible goods arrive sequentially and must be allocated immediately and irrevocably. Prior work establishes strong impossibilit…
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…