Showing 2026Show all
2 papers · 1 filter
cs.DS2026
Fair Division Meets Scheduling: Approximately Envy-Free Interval Scheduling
Sander Borst, Golnoosh Shahkarami, Rohit Vaish
We study interval scheduling from the perspective of fair allocation. There are identical machines and a set of intervals, each specified by a start time, an end time, and a no…
cs.GT2026
Beyond the Half-Approximation: Fair and Efficient Online Class Matching
Sander Borst, Max Springer
Online bipartite matching, where agents are known in advance but items arrive sequentially and must be irrevocably assigned, is fundamental to problems ranging from ride-sharing to…