Основные понятия
Proposing axiomatic study and algorithms for collective scheduling problems.
Аннотация
The content discusses the collective schedules problem, introducing axioms and algorithms for computing consensus schedules. It covers applications, related work, rules for scheduling, and experimental conclusions. A comprehensive analysis of axiomatic properties and algorithmic solutions is provided.
Статистика
"Tasks may have different duration, and individuals have preferences over the order of the shared tasks."
"We show that some axioms are incompatible, and we study the axioms fulfilled by three rules."
"We show that these rules solve NP-hard problems."
Цитаты
"We propose an axiomatic study of the collective schedule problem."
"We conclude this paper with experiments."