3 citations · 3 across the 5 of their papers we have counts for
5 papers
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…
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…
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…
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…
Envy-Free House Allocation with Minimum Subsidy
Davin Choo, Yan Hao Ling, Warut Suksompong +2
House allocation refers to the problem where houses are to be allocated to agents so that each agent receives one house. Since an envy-free house allocation does not always…