@inproceedings{f7d2ca39b80c4111ad1f77c28bb8bf57,
title = "Assigning course schedules: About preference elicitation, fairness, and truthfulness",
abstract = "Most organizations face distributed scheduling problems where private preferences of individuals matter. Course assignment is a widespread example arising in educational institutions and beyond. Often students have preferences for course schedules over the week. FirstComeFirstServed (FCFS) is the most widely used assignment rule in practice, but it is inefficient and unfair. Recent work on randomized matching suggests an alternative with attractive properties - Bundled Probabilistic Serial (BPS). A major challenge in BPS is that the mechanism requires the participants' preferences for exponentially many schedules. We describe a way to elicit preferences reducing the number of required parameters to a manageable set. We report results from field experiments, which allow us to analyze important empirical metrics of the assignments compared to FCFS. These metrics were central for the adoption of BPS at a major university. The overall system design yields an effective approach to solve daunting distributed scheduling tasks in organizations.",
keywords = "Computational Social Science, Course Assignment, Field Study, Preference Elicitation",
author = "Martin Bichler and S{\"o}ren Merting and Aykut Uzunoglu",
note = "Publisher Copyright: {\textcopyright} 40th International Conference on Information Systems, ICIS 2019. All rights reserved.; 40th International Conference on Information Systems, ICIS 2019 ; Conference date: 15-12-2019 Through 18-12-2019",
year = "2019",
language = "English",
series = "40th International Conference on Information Systems, ICIS 2019",
publisher = "Association for Information Systems",
booktitle = "40th International Conference on Information Systems, ICIS 2019",
}