3 papers
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
Maximizing Nash Social Welfare in 2-Value Instances: Delineating Tractability
Hannaneh Akrami, Bhaskar Ray Chaudhury, Martin Hoefer +6
We study the problem of allocating a set of indivisible goods among a set of agents with \emph{2-value additive valuations}. In this setting, each good is valued either or $p/q…
cs.LG2025
A Switching Framework for Online Interval Scheduling with Predictions
Antonios Antoniadis, Ali Shahheidar, Golnoosh Shahkarami +1
We study online interval scheduling in the irrevocable setting, where each interval must be immediately accepted or rejected upon arrival. The objective is to maximize the total le…