The internet has enabled the collaboration of groups at a scale that was unseen before. A key problem for large collaboration groups is to be able to allocate tasks effectively. An effective task assignment method should consider both how fit teams are for each job as well as how fair the assignment is to team members, in terms that no one should be overloaded or unfairly singled out. The assignment has to be done automatically or semi-automatically given that it is difficult and time-consuming to keep track of the skills and the workload of each person. Obviously the method to do this assignment must also be computationally efficient. In this paper we present a general framework for task-assignment problems. We provide a formal treatment on how to represent teams and tasks. We propose alternative functions for measuring the fitness of a team performing a task and we discuss desirable properties of those functions. Then we focus on one class of task-assignment problems, we characterize the complexity of the problem, and we provide algorithms with provable approximation guarantees, as well as lower bounds. We also present experimental results that show that our methods are useful in practice in several application scenarios. © 2010 ACM.

Power in unity: Forming teams in large-scale community systems / Anagnostopoulos, Aristidis; Becchetti, Luca; Carlos, Castillo; Aristides, Gionis; Leonardi, Stefano. - (2010), pp. 599-608. (Intervento presentato al convegno 19th International Conference on Information and Knowledge Management and Co-located Workshops, CIKM'10 tenutosi a Toronto; Canada nel 26 October 2010 through 30 October 2010) [10.1145/1871437.1871515].

Power in unity: Forming teams in large-scale community systems

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

Abstract

The internet has enabled the collaboration of groups at a scale that was unseen before. A key problem for large collaboration groups is to be able to allocate tasks effectively. An effective task assignment method should consider both how fit teams are for each job as well as how fair the assignment is to team members, in terms that no one should be overloaded or unfairly singled out. The assignment has to be done automatically or semi-automatically given that it is difficult and time-consuming to keep track of the skills and the workload of each person. Obviously the method to do this assignment must also be computationally efficient. In this paper we present a general framework for task-assignment problems. We provide a formal treatment on how to represent teams and tasks. We propose alternative functions for measuring the fitness of a team performing a task and we discuss desirable properties of those functions. Then we focus on one class of task-assignment problems, we characterize the complexity of the problem, and we provide algorithms with provable approximation guarantees, as well as lower bounds. We also present experimental results that show that our methods are useful in practice in several application scenarios. © 2010 ACM.
2010
19th International Conference on Information and Knowledge Management and Co-located Workshops, CIKM'10
scheduling; task assignment; team formation
04 Pubblicazione in atti di convegno::04b Atto di convegno in volume
Power in unity: Forming teams in large-scale community systems / Anagnostopoulos, Aristidis; Becchetti, Luca; Carlos, Castillo; Aristides, Gionis; Leonardi, Stefano. - (2010), pp. 599-608. (Intervento presentato al convegno 19th International Conference on Information and Knowledge Management and Co-located Workshops, CIKM'10 tenutosi a Toronto; Canada nel 26 October 2010 through 30 October 2010) [10.1145/1871437.1871515].
File allegati a questo prodotto
File Dimensione Formato  
VE_2010_11573-377389.pdf

solo gestori archivio

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 508.59 kB
Formato Adobe PDF
508.59 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/377389
 Attenzione

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

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