k,v-Partition Team Formation Problem with Participant Agency

Abstract

Giving candidate teammates agency is becoming an increasingly important aspect of the Team Formation Problem(TFP); the problem of forming a team or multiple teams out of a pool of participants. This thesis gives a taxonomy of the several extensions of TFP in the literature. This overview divides the TFP into seven subproblems and shows the gaps in the work field. In addition, one of the extensions is examined, namely the \textit{k,v}-Partition TFP. A group of candidates is divided into optimal teams based on the skill levels and preferences of the candidates. We present four ILP models to solve this problem with different skill requirements. The models produced an optimal team formation for a group of 25 candidates. Within two hours, the models managed to divide a group of 60 candidates close to optimal. Therefore, we recommend using a heuristic method for partitioning with larger groups.