Online team formation in social networks

Abstract

We study the problem of online team formation. We consider a setting in which people possess different skills and compatibility among potential team members is modeled by a social network. A sequence of tasks arrives in an online fashion, and each task requires a specific set of skills. The goal is to form a new team upon arrival of each task, so that (i) each team possesses all skills required by the task, (ii) each team has small communication overhead, and (iii) the workload of performing the tasks is balanced among people in the fairest possible way.We propose efficient algorithms that address all these requirements: our 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. Experiments performed on collaboration networks among film actors and scientists, confirm that our algorithms are successful at balancing these conflicting requirements. This is the first paper that simultaneously addresses all these aspects. Previous work has either focused on minimizing coordination for a single task or balancing the workload neglecting coordination costs.

An FPTAS for the fractional group Steiner tree problem

“…Furthermore, the solution to the FGST problem can be used as a good lower bound in the optimal solution to the GST problem in some general linear integer programming techniques. Besides being a very common application for the problem associated with wire routing and multiport terminals in physical VLSI design [24], the GST problem can be applied to find teams of experts in social networks that are supposed to have solved some of the specific tasks [21,1,22]. This application requires extremely fast algorithms, since social networks grows rapidly.…”

“…Let us assume the introduction of a new vertex g i for each group G i and a directed edge from g i to each vertex v ∈ G i with infinite capacity. The value of variable z e is interpreted as the capacity of edge e. The conditions in (1) ensure that the capacity of each cut separating some group G i from root r (or equivalently, a g i from r) is at least one. Using the max-flow min-cut theorem, it becomes evident that capacities z e are sufficient to send at least one unit of flow from each vertex g i , to root r.…”

Resource Allocation in Software Projects Using a Bio-inspired Model

“…They studied and analyzed instances of the problem and they also proposed practical algorithmic solutions considering communication costs. Anagnostopoulos et al in [12] proposed efficient algorithms that address task allocation and team formation such that the required skills are satisfied and approximation guarantees, with respect to team communication overhead, are provided.…”

Top-k Team Recommendation and Its Variants in Spatial Crowdsourcing

“…Anagnostopoulos et al [26,27] further studies the workload balance issue in the static and dynamic team formation problem. The capacity constraint of experts is also considered as an variant of the team formation problem in [15].…”