Amortized efficiency of list update and paging rules
Communications of the ACM
The competitiveness of on-line assignments
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Many birds with one stone: multi-objective approximation algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM (JACM)
A polylogarithmic approximation algorithm for the group Steiner tree problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Approximation algorithms
The Constrained Minimum Spanning Tree Problem (Extended Abstract)
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
On the approximability of trade-offs and optimal access of Web sources
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Agent-organized networks for dynamic team formation
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Bounds on multiprocessing anomalies and related packing algorithms
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Finding a team of experts in social networks
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
A greedy approximation algorithm for the group Steiner problem
Discrete Applied Mathematics
Power in unity: forming teams in large-scale community systems
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Team Formation for Generalized Tasks in Expertise Social Networks
SOCIALCOM '10 Proceedings of the 2010 IEEE Second International Conference on Social Computing
Composing near-optimal expert teams: a trade-off between skills and connectivity
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems - Volume Part I
Discovering top-k teams of experts with/without a leader in social networks
Proceedings of the 20th ACM international conference on Information and knowledge management
Capacitated team formation problem on social networks
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Assessing the impact of the social network on marking photos as favorites in flickr
Proceedings of the 18th Brazilian symposium on Multimedia and the web
Efficient bi-objective team formation in social networks
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II
Proceedings of the 2013 conference on Computer supported cooperative work
Towards realistic team formation in social networks based on densest subgraphs
Proceedings of the 22nd international conference on World Wide Web
Efficient algorithms for team formation with a leader in social networks
The Journal of Supercomputing
A multi-criteria ranking framework for partner selection in scientific collaboration environments
Decision Support Systems
| Hi-index | 0.00 |
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.