Collective Schedules: Scheduling Meets Computational Social Choice - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

Collective Schedules: Scheduling Meets Computational Social Choice

Fanny Pascual
  • Function : Author
  • PersonId : 855950
Krzysztof Rzadca
  • Function : Author
  • PersonId : 830231

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 Con-dorcet 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.
Fichier principal
Vignette du fichier
2018_collsched_aamas.pdf (852.88 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01744728 , version 1 (27-03-2018)

Identifiers

  • HAL Id : hal-01744728 , version 1

Cite

Fanny Pascual, Krzysztof Rzadca, Piotr Skowron. Collective Schedules: Scheduling Meets Computational Social Choice. Seventeenth International Conference on Autonomous Agents and Multiagent Systems , Jul 2018, Stockholm, Sweden. ⟨hal-01744728⟩
159 View
26 Download

Share

Gmail Facebook X LinkedIn More