3 papers
cs.GT2026
No, Cake Cutting Really is a Piece of Cake
Stephen Arndt, Benjamin Moseley, Sungjin Im +1
We design and analyze a deterministic cake cutting algorithm that achieves proportional fairness using a linear number of cuts. The best previous upper bound on the number of cuts…
cs.LG2026
Learning-Augmented Online Scheduling with Parsimonious Preemption
Mugen Blue, Sungjin Im, Alexander Lindermayr
Learning-augmented algorithms have emerged as a powerful paradigm to surpass traditional worst-case lower bounds by integrating potentially noisy predictions. While this framework…
cs.GT2024
Strategic Facility Location via Predictions
Qingyun Chen, Nick Gravin, Sungjin Im
The facility location with strategic agents is a canonical problem in the literature on mechanism design without money. Recently, Agrawal et. al. considered this problem in the con…