Team Formation amidst Conflicts (2403.00859v1)
Abstract: In this work, we formulate the problem of team formation amidst conflicts. The goal is to assign individuals to tasks, with given capacities, taking into account individuals' task preferences and the conflicts between them. Using dependent rounding schemes as our main toolbox, we provide efficient approximation algorithms. Our framework is extremely versatile and can model many different real-world scenarios as they arise in educational settings and human-resource management. We test and deploy our algorithms on real-world datasets and we show that our algorithms find assignments that are better than those found by natural baselines. In the educational setting we also show how our assignments are far better than those done manually by human experts. In the human resource management application we show how our assignments increase the diversity of teams. Finally, using a synthetic dataset we demonstrate that our algorithms scale very well in practice.
- Alexander A Ageev and Maxim I Sviridenko. 2004. Pipage rounding: A new method of constructing algorithms with proven performance guarantee. Journal of Combinatorial Optimization 8 (2004), 307–328.
- Power in unity: forming teams in large-scale community systems. In Proceedings of the 19th ACM international conference on Information and knowledge management. 599–608.
- Algorithms for hiring and outsourcing in the online labor market. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 1109–1118.
- Capacitated metric labeling. In Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 976–995.
- Stephen P Boyd and Lieven Vandenberghe. 2004. Convex optimization. Cambridge university press.
- Moses Charikar. 2000. Greedy approximation algorithms for finding dense components in a graph. In International workshop on approximation algorithms for combinatorial optimization. Springer, 84–95.
- Dependent randomized rounding via exchange properties of combinatorial structures. In 2010 IEEE 51st Annual Symposium on Foundations of Computer Science. IEEE, 575–584.
- David Gale and Lloyd S Shapley. 1962. College admissions and the stability of marriage. The American Mathematical Monthly 69, 1 (1962), 9–15.
- Dependent rounding in bipartite graphs. In The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings. IEEE, 323–332.
- Michel X Goemans and David P Williamson. 1994. New 34-approximation algorithms for the maximum satisfiability problem. SIAM Journal on Discrete Mathematics 7, 4 (1994), 656–666.
- Dan Gusfield and Robert W Irving. 1989. The stable marriage problem: structure and algorithms. MIT press.
- Finding affordable and collaborative teams from a network of experts. In Proceedings of the 2013 SIAM international conference on data mining. SIAM, 587–595.
- Richard M Karp. 2010. Reducibility among combinatorial problems. Springer.
- Jon Kleinberg and Eva Tardos. 2002. Approximation algorithms for classification problems with pairwise relationships: Metric labeling and Markov random fields. Journal of the ACM (JACM) 49, 5 (2002), 616–639.
- Harold W Kuhn. 1955. The Hungarian method for the assignment problem. Naval research logistics quarterly 2, 1-2 (1955), 83–97.
- Finding a team of experts in social networks. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. 467–476.
- Capacitated team formation problem on social networks. In Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining. 1005–1013.
- David G McVitie and Leslie B Wilson. 1971. The stable marriage problem. Commun. ACM 14, 7 (1971), 486–490.
- Marcos Negreiros and Augusto Palhano. 2006. The capacitated centred clustering problem. Computers & operations research 33, 6 (2006), 1639–1663.
- Karan Vombatkere and Evimaria Terzi. 2023. Balancing Task Coverage and Expert Workload in Team Formation. In Proceedings of the 2023 SIAM International Conference on Data Mining (SDM). SIAM, 640–648.
- Ulrike Von Luxburg. 2007. A tutorial on spectral clustering. Statistics and computing 17 (2007), 395–416.
- Data clustering with size constraints. Knowledge-Based Systems 23, 8 (2010), 883–889.