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.

Online team formation in social networks / Anagnostopoulos, Aristidis; Becchetti, Luca; Carlos, Castillo; Aristides, Gionis; Leonardi, Stefano. - (2012), pp. 839-848. (Intervento presentato al convegno 21st Annual Conference on World Wide Web, WWW'12 tenutosi a Lyon, France nel 16 April 2012 through 20 April 2012) [10.1145/2187836.2187950].

Online team formation in social networks

ANAGNOSTOPOULOS, ARISTIDIS;BECCHETTI, Luca;LEONARDI, Stefano
2012

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.
2012
21st Annual Conference on World Wide Web, WWW'12
scheduling; task assignment; team formation
04 Pubblicazione in atti di convegno::04b Atto di convegno in volume
Online team formation in social networks / Anagnostopoulos, Aristidis; Becchetti, Luca; Carlos, Castillo; Aristides, Gionis; Leonardi, Stefano. - (2012), pp. 839-848. (Intervento presentato al convegno 21st Annual Conference on World Wide Web, WWW'12 tenutosi a Lyon, France nel 16 April 2012 through 20 April 2012) [10.1145/2187836.2187950].
File allegati a questo prodotto
File Dimensione Formato  
VE_2012_11573-445808.pdf

solo gestori archivio

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 454.99 kB
Formato Adobe PDF
454.99 kB Adobe PDF   Contatta l'autore

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/445808
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 256
  • ???jsp.display-item.citation.isi??? ND
social impact