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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Aziz, H., Caragiannis, I., Igarashi, A., Walsh, T.: Fair allocation of indivisible goods and chores. In: IJCAI, pp. 53–59 (2019)
Aziz, H., Rauchecker, G., Schryen, G., Walsh, T.: Algorithms for max-min share fair allocation of indivisible chores. In: AAAI, pp. 335–341 (2017)
Barman, S., Krishnamurthy, S.K., Vaish, R.: Finding fair and efficient allocations. In: Proceedings of the 2018 ACM Conference on Economics and Computation, EC 2018, pp. 557–574. ACM, New York (2018)
Bogomolnaia, A., Moulin, H., Sandomirskiy, F., Yanovskaia, E.: Dividing bads under additive utilities. Soc. Choice Welfare 52(3), 395–417 (2018). https://doi.org/10.1007/s00355-018-1157-x
Brams, S.J., Taylor, A.D.: Fair Division: From Cake-Cutting to Dispute Resolution. Cambridge University Press, Cambridge (1996)
Bredereck, R., Kaczmarczyk, A., Knop, D., Niedermeier, R.: High-multiplicity fair allocation: lenstra empowered by n-fold integer programming. In: Proceedings of the 2019 ACM Conference on Economics and Computation, EC 2019, pp. 505–523. ACM, New York (2019)
Budish, E.: The combinatorial assignment problem: approximate competitive equilibrium from equal incomes. J. Polit. Econ. 119(6), 1061–1103 (2011)
Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M.: The efficiency of fair division. Theory Comput. Syst. 50(4), 589–610 (2012)
Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A.D., Shah, N., Wang, J.: The unreasonable fairness of maximum nash welfare. In: Proc. of the ACM Conference on Economics and Computation (EC). pp. 305–322. New York, USA (2016)
Darmann, A.: Group activity selection from ordinal preferences. In: Walsh, T. (ed.) ADT 2015. LNCS (LNAI), vol. 9346, pp. 35–51. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-23114-3_3
Darmann, A., Elkind, E., Kurz, S., Lang, J., Schauer, J., Woeginger, G.: Group activity selection problem. In: Goldberg, P.W. (ed.) WINE 2012. LNCS, vol. 7695, pp. 156–169. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-35311-6_12
E Gaston, M., Simmons, J., desJardins, M.: Adapting network structure for efficient team formation, January 2004
Gutiérrez, J.H., Astudillo, C.A., Ballesteros-Pérez, P., Mora-Melià, D., Candia-Véjar, A.: The multiple team formation problem using sociometry. Comput. Oper. Res. 75, 150–162 (2016)
Igarashi, A., Peters, D., Elkind, E.: Group activity selection on social networks. CoRR
Lappas, T., Liu, K., Terzi, E.: Finding a team of experts in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 467–476. ACM, New York (2009)
Lipton, R.J., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: Proceedings of the 5th ACM Conference on Electronic Commerce, EC 2004, pp. 125–131. ACM, New York (2004)
Majumder, A., Datta, S., Naidu, K.: Capacitated team formation problem on social networks. In: Proceeding of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1005–1013. ACM, New York (2012)
Marcolino, L.S., Jiang, A.X., Tambe, M.: Multi-agent team formation: diversity beats strength? In: IJCAI, pp. 279–285 (2013)
Zzkarian, A., Kusiak, A.: Forming teams: an analytical approach. IIE Trans. 31(1), 85–97 (1999)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Bulmer, J., Fritter, M., Gao, Y., Hui, B. (2020). FASTT: Team Formation Using Fair Division. In: Goutte, C., Zhu, X. (eds) Advances in Artificial Intelligence. Canadian AI 2020. Lecture Notes in Computer Science(), vol 12109. Springer, Cham. https://doi.org/10.1007/978-3-030-47358-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-030-47358-7_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-47357-0
Online ISBN: 978-3-030-47358-7
eBook Packages: Computer ScienceComputer Science (R0)