WorksComputer Science

Tight Analysis of Randomized Truthful Scheduling: An $(m+1)/2$ Lower Bound

Published Nov 03, 2026Fresh — added to the Hub within the last 30 daysv1

Publication details

AI contributions

Not recorded for this paper

Versions

Each version keeps its own PDF, citation, and review record. Endorsements stay with the version they examined.

1 versionNewest first

Beginning of version history