TY  - CONF
A1  - Merting, Sören
A1  - Bichler, Martin
A1  - Uzunoglu, Aykut
A2  - Krcmar, Helmut
A2  - Fedorowicz, Jane
A2  - Fong Boh, Wai
A2  - Leimeister, Jan Marco
A2  - Wattal, Sunil
T1  - Assigning course schedules: about preference elicitation, fairness, and truthfulness
T2  - International Conference on Information Systems (ICIS) 2019, Munich, Germany, December 15-18, 2019, proceedings
N2  - Most organizations face distributed scheduling problems where private preferences of individuals mat­ter. Course assignment is a widespread example arising in educational institutions and beyond. Often students have preferences for course schedules over the week. First­Come­First­Served (FCFS) is the most widely used assignment rule in practice, but it is inefficient and unfair. Recent work on randomized match­ing suggests an alternative with attractive properties – Bundled Probabilistic Serial (BPS). A major chal­lenge 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 as­ signments 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.
Y1  - 2023
UR  - https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/107361
UR  - https://nbn-resolving.org/urn:nbn:de:bvb:384-opus4-1073611
UR  - https://aisel.aisnet.org/icis2019/data_science/data_science/15/
SN  - 978-0-9966831-9-7
SP  - 15
PB  - AIS Electronic Library (AISeL)
CY  - New York, NY
ER  -