Submodularity in Team Formation Problem

@inproceedings{Bhowmik2014SubmodularityIT,
  title={Submodularity in Team Formation Problem},
  author={Avradeep Bhowmik and Vivek S. Borkar and Dinesh Garg and Madhavan Pallan},
  booktitle={SDM},
  year={2014}
}
We consider the team formation problem where the goal is to find a team of experts for a specific project. In the past, several attempts have been made to formulate this problem and each formulation focuses only on a subset of design criteria such as skill coverage, social compatibility, economy, skill redundancy, etc. In this paper, for the first time, we show that most of the important design criteria for this problem can be fully modeled within one single formulation as an unconstrained… 

Figures from this paper

Team Formation: Striking a Balance between Coverage and Cost
TLDR
The problem formulation and algorithms are of independent interest and can be used in many applications where there is a submodular objective and a linear cost and are the first to formalize the team-formation problem in this manner.
Team Formation: Balancing Task Coverage and Expert Workload
  • Computer Science
  • 2022
TLDR
This paper proposes a variant of the classical team-formation problem, where all the skills of every task need not be covered; rather, it aims to cover the skillsof every task as well as possible, while also trying to minimize the maximum workload among the experts.
A Branch-and-Bound Algorithm for Team Formation on Social Networks
This paper presents an exact algorithm for the team formation problem, in which the aim is, given a project and its required skills, to construct a capable team that can communicate and collaborate
Template-Driven Team Formation
TLDR
This paper considers the Template-Driven Team Formation problem, where given a fixed template structure for the team, in the form of a graph, and a designated role for each node in the template, it is asked for workers that can fill the roles in thetemplate, while minimizing the communication cost along the template edges.
An Efficient Framework for Balancing Submodularity and Cost
TLDR
This paper considers a generalization of the classical selection problem where the goal is to optimize a function that maximizes the submodular function ƒ minus a linear cost function cost and designs algorithms that have provable approximation guarantees, are extremely efficient and work very well in practice.
The Guided Team-Partitioning Problem: Definition, Complexity, and Algorithm
TLDR
This work introduces the Guided Team-Partitioning (GTP) problem, which asks for the partitioning of a population into teams such that the centroid of each team is as close as possible to a given target vector, and proves that GTP is NP-hard to solve and even to approximate.
Minimizing Tension in Teams
TLDR
Although it is shown that k- AlterHabit is NP-hard, the authors devise polynomial-time algorithms for solving it in practice and demonstrate both the efficiency and the efficacy of the algorithmic techniques on a collection of real data.
Finding Teams of Maximum Mutual Respect
TLDR
The MaxMutualRespect problem is defined, a novel team-formation problem that asks for a set of experts, each assigned to a distinct role, such that the total respect that the individuals receive by the rest of the team members for their assigned role is maximized.
USTF: A Unified System of Team Formation
TLDR
This paper compares and contrast all the state-of-the-art team formation algorithms and proposes a benchmark that enables fair comparison amongst these algorithms and presents a case study that shows the performance of different algorithms in a range of real world cases.
...
...

References

SHOWING 1-10 OF 15 REFERENCES
Discovering top-k teams of experts with/without a leader in social networks
TLDR
Two procedures that produce top-k teams of experts with or without a leader in polynomial delay are proposed and the effectiveness and scalability of the proposed methods are demonstrated.
Submodular maximization by simulated annealing
TLDR
A new algorithm for submodular maximization which is based on the idea of simulated annealing is proposed and it is proved that this algorithm achieves improved approximation for two problems: a 0.41-approximation for unconstrained submodul maximization, and a0.325-app approximation subject to a matroid independence constraint.
Efficient Bi-objective Team Formation in Social Networks
TLDR
The problem of finding a team of experts from a social network to complete a project that requires a set of skills and minimizes the communication cost as well as the personnel cost is tackled.
Team Formation for Generalized Tasks in Expertise Social Networks
  • Cheng-te Li, M. Shan
  • Computer Science
    2010 IEEE Second International Conference on Social Computing
  • 2010
TLDR
This work extends the Enhanced-Steiner algorithm to a generalized version for generalized tasks, and presents a novel grouping-based method that condenses the expertise information to a group graph according to required skills.
Multi-skill Collaborative Teams based on Densest Subgraphs
TLDR
This work presents a 3-approximation algorithm that improves upon a naive extension of the previously known algorithm for densest at least $k$ subgraph problem and shows how the same approximation can be extended to a special case of multiple skills.
Capacitated team formation problem on social networks
TLDR
This work investigates how team formation problems are proven to be NP-hard and designs efficient approximate algorithms for finding near optimum teams with provable guarantees that achieve significant improvement in finding effective teams.
Online team formation in social networks
TLDR
This paper proposes efficient algorithms that address all requirements of online team formation: these algorithms form teams that always satisfy the required skills, provide approximation guarantees with respect to team communication overhead, and they are online-competitive with Respect to load balancing.
An analysis of approximations for maximizing submodular set functions—I
TLDR
It is shown that a “greedy” heuristic always produces a solution whose value is at least 1 −[(K − 1/K]K times the optimal value, which can be achieved for eachK and has a limiting value of (e − 1)/e, where e is the base of the natural logarithm.
Finding a team of experts in social networks
TLDR
This work is the first work to consider the TEAM FORMATION problem in the presence of a social network of individuals and measures effectiveness using the communication cost incurred by the subgraph in G that only involves X'.
Forming teams: an analytical approach
The selection of multi-functional teams is a key issue in problem solving. Currently there are no papers in the literature that discuss analytical approaches to forming teams. Furthermore, no
...
...