Online team formation in social networks

Aris Anagnostopoulos, Luca Becchetti, Carlos Castillo, Aristides Gionis, Stefano Leonardi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

157 Citations (Scopus)

Abstract

We study the problem of online team formation. We con- sider 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 re- quirements: 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. Experi- ments performed on collaboration networks among film ac- tors and scientists, confirm that our algorithms are success- ful at balancing these conflicting requirements. This is the first paper that simultaneously addresses all these aspects. Previous work has either focused on minimiz- ing coordination for a single task or balancing the workload neglecting coordination costs.

Original languageEnglish
Title of host publicationWWW'12 - Proceedings of the 21st Annual Conference on World Wide Web
Pages839-848
Number of pages10
DOIs
Publication statusPublished - 16 May 2012
Externally publishedYes
Event21st Annual Conference on World Wide Web, WWW'12 - Lyon, France
Duration: 16 Apr 201220 Apr 2012

Other

Other21st Annual Conference on World Wide Web, WWW'12
CountryFrance
CityLyon
Period16/4/1220/4/12

Fingerprint

Communication
Resource allocation
Costs
Experiments

Keywords

  • Scheduling
  • Task assignment
  • Team formation

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Anagnostopoulos, A., Becchetti, L., Castillo, C., Gionis, A., & Leonardi, S. (2012). Online team formation in social networks. In WWW'12 - Proceedings of the 21st Annual Conference on World Wide Web (pp. 839-848) https://doi.org/10.1145/2187836.2187950

Online team formation in social networks. / Anagnostopoulos, Aris; Becchetti, Luca; Castillo, Carlos; Gionis, Aristides; Leonardi, Stefano.

WWW'12 - Proceedings of the 21st Annual Conference on World Wide Web. 2012. p. 839-848.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Anagnostopoulos, A, Becchetti, L, Castillo, C, Gionis, A & Leonardi, S 2012, Online team formation in social networks. in WWW'12 - Proceedings of the 21st Annual Conference on World Wide Web. pp. 839-848, 21st Annual Conference on World Wide Web, WWW'12, Lyon, France, 16/4/12. https://doi.org/10.1145/2187836.2187950
Anagnostopoulos A, Becchetti L, Castillo C, Gionis A, Leonardi S. Online team formation in social networks. In WWW'12 - Proceedings of the 21st Annual Conference on World Wide Web. 2012. p. 839-848 https://doi.org/10.1145/2187836.2187950
Anagnostopoulos, Aris ; Becchetti, Luca ; Castillo, Carlos ; Gionis, Aristides ; Leonardi, Stefano. / Online team formation in social networks. WWW'12 - Proceedings of the 21st Annual Conference on World Wide Web. 2012. pp. 839-848
@inproceedings{0f541bdd666a4dbda16cd82c4f9df82c,
title = "Online team formation in social networks",
abstract = "We study the problem of online team formation. We con- sider 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 re- quirements: 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. Experi- ments performed on collaboration networks among film ac- tors and scientists, confirm that our algorithms are success- ful at balancing these conflicting requirements. This is the first paper that simultaneously addresses all these aspects. Previous work has either focused on minimiz- ing coordination for a single task or balancing the workload neglecting coordination costs.",
keywords = "Scheduling, Task assignment, Team formation",
author = "Aris Anagnostopoulos and Luca Becchetti and Carlos Castillo and Aristides Gionis and Stefano Leonardi",
year = "2012",
month = "5",
day = "16",
doi = "10.1145/2187836.2187950",
language = "English",
isbn = "9781450312295",
pages = "839--848",
booktitle = "WWW'12 - Proceedings of the 21st Annual Conference on World Wide Web",

}

TY - GEN

T1 - Online team formation in social networks

AU - Anagnostopoulos, Aris

AU - Becchetti, Luca

AU - Castillo, Carlos

AU - Gionis, Aristides

AU - Leonardi, Stefano

PY - 2012/5/16

Y1 - 2012/5/16

N2 - We study the problem of online team formation. We con- sider 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 re- quirements: 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. Experi- ments performed on collaboration networks among film ac- tors and scientists, confirm that our algorithms are success- ful at balancing these conflicting requirements. This is the first paper that simultaneously addresses all these aspects. Previous work has either focused on minimiz- ing coordination for a single task or balancing the workload neglecting coordination costs.

AB - We study the problem of online team formation. We con- sider 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 re- quirements: 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. Experi- ments performed on collaboration networks among film ac- tors and scientists, confirm that our algorithms are success- ful at balancing these conflicting requirements. This is the first paper that simultaneously addresses all these aspects. Previous work has either focused on minimiz- ing coordination for a single task or balancing the workload neglecting coordination costs.

KW - Scheduling

KW - Task assignment

KW - Team formation

UR - http://www.scopus.com/inward/record.url?scp=84860875663&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84860875663&partnerID=8YFLogxK

U2 - 10.1145/2187836.2187950

DO - 10.1145/2187836.2187950

M3 - Conference contribution

AN - SCOPUS:84860875663

SN - 9781450312295

SP - 839

EP - 848

BT - WWW'12 - Proceedings of the 21st Annual Conference on World Wide Web

ER -