Title
Collective Schedules: Scheduling Meets Computational Social Choice
Abstract
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.
Year
DOI
Venue
2018
10.5555/3237383.3237482
PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS (AAMAS' 18)
Keywords
DocType
Volume
scheduling, computational social choice, participatory scheduling
Conference
abs/1803.07484
Citations 
PageRank 
References 
0
0.34
7
Authors
3
Name
Order
Citations
PageRank
Fanny Pascual19714.48
Krzysztof Rzadca220919.13
Piotr Skowron327933.08