Name
Abstract | ||
|---|---|---|
We consider the problem of multiple team formation within a project-based university course. Given several tasks with requirements and several students with skills, we investigate the problem of assigning teams of students to tasks as fairly as possible so that each task’s requirements are maximally met. Instead of using traditional team formation techniques, we adapt the fair division formulation by considering tasks as agents and students as items. Furthermore, we present a novel framework that generalizes fair division to account for order within the assignment phase. Finally, we present an algorithm to address instances of team formation within this new setting. Our empirical experiments show that this new algorithm performs better than existing fair division algorithms in terms of speed and fairness, as defined by complete balance ordered and up to one individual. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/978-3-030-47358-7_9 | Canadian Conference on AI |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jeff Bulmer | 1 | 0 | 0.34 |
| Matthew Fritter | 2 | 0 | 0.34 |
| Yong Gao | 3 | 0 | 0.34 |
| Bowen Hui | 4 | 53 | 7.27 |