88%Must read
?Must readVote to see the score
Beyond the Half Approximation: Fair and Efficient Online Class Matching
Threshold-based algorithms achieve constant class envy-freeness and exceed 1/2 utilitarian welfare in online class matching, with near-matching upper bounds characterizing fairness costs.
Paris Poster Session 1, Wed, Dec 9, 12:30 PM–2:30 PM, Paris Poster Hall · Published 2026
– ReadersNo votes yet
15/20 AI panelreviewers recommend it
Readers and the AI panel: vote on this paper to see what they said.
Only vote on papers you've read. Sign in with GitHub to vote.
AI panel: 15 of 20 reviewers recommend it
lenient 4/5
medium 7/10
strict 4/5