# Collective Schedules: Scheduling Meets Computational Social Choice

arXiv: https://arxiv.org/abs/1803.07484 · HTML: https://mlsanity.com/paper/1803.07484/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 20 Mar 2018.

## Built on by (most cited first, 2 of 2)

- [Collective discrete optimisation as judgment aggregation](https://mlsanity.com/paper/2112.00574/) (2021)
- [A General Theory of Proportionality with Additive Utilities](https://mlsanity.com/paper/2602.08504/) (2026)

## Abstract (arXiv)

When scheduling public works or events in a shared facility one needs to accommodate preferences of a population. We formalize this problem by introducing the notion of a collective schedule. We show how to extend fundamental tools from social choice theory---positional scoring rules, the Kemeny rule and the Condorcet principle---to collective scheduling. We study the computational complexity of finding collective schedules. We also experimentally demonstrate that optimal collective schedules can be found for instances with realistic sizes.