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

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2010, Pages 599-608

  Anagnostopoulos, Aris ^a   Becchetti, Luca ^a   Castillo, Carlos ^b   Gionis, Aristides ^b   Leonardi, Stefano ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b YAHOO RESEARCH   (Spain)

Author keywords

Scheduling; Task assignment; Team formation

Indexed keywords

APPLICATION SCENARIO; ASSIGNMENT PROBLEMS; COLLABORATION GROUP; COMMUNITY SYSTEM; COMPUTATIONALLY EFFICIENT; KEY PROBLEMS; LOWER BOUNDS; TASK ASSIGNMENT; TEAM FORMATION; TEAM MEMBERS;

APPROXIMATION ALGORITHMS; KNOWLEDGE MANAGEMENT;

MANAGEMENT SCIENCE;

EID: 78651277509     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1871437.1871515     Document Type: Conference Paper

References (24)

1. M. Abrol, U. Mahadevan, K. McCracken, R. Mukherjee, and P. Raghavan. Social networks for enterprise webs. In Proc. of WWW, 2002.
2. J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts. Online routing of virtual circuits with applications to load balancing and machine scheduling. J. ACM, 44(3):486-504, 1997.
3. Y. Azar. Online load balancing. In Theoret. Comp. Sci. Springer, 1992.
4. Y. Azar, J. Naor, and R. Rom. The competitiveness of on-line assignments. In Proc. of SODA, 1992.
5. K. Balog, L. Azzopardi, and M. de Rijke. Formal models for expert finding in enterprise corpora. In Proc. of SIGIR, New York, NY, USA, 2006. ACM Press.
6. K. Balog and M. De Rijke. Determining expert profiles (with an application to expert finding). In Proc. of IJGAI, San Francisco, CA, USA, 2007. Morgan Kaufmann.
7. A. Borodin and R. El-Yaniv. Online computation and competitive analysis. Cambridge University Press, 1998.
8. F. P. Brooks. The Mythical Man-Month: Essays on Software Engineering. Addison-Wesley Professional, 1995.
9. C. S. Campbell, P. P. Maglio, A. Cozzi, and B. Dom. Expertise identification using email communications. In CIKM, 2003.
10. V. Chvatal. A greedy heuristic for the set-covering problem. Math. of Operations Research, 4(3), 1979.
11. N. Craswell, A. P. de Vries, and I. Soboroff, editors. Proc. of 14th TREC, volume 500-266 of Inf. Tech. Lab. NIST Special Pubs. NIST, 2005.
12. N. Craswell, D. Hawking, A. marie Vercoustre, and P. Wilkins. P@noptic expert: Searching for experts not just for documents. In Proc. of AusWeb, 2001.
13. H. Deng, I. King, and M. R. Lyu. Formal models for expert finding on DBLP bibliography data. In ICDM, 2008.
14. D. Dubhashi and A. Panconesi. Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, 2009.
15. A. Fiat and G. J. Woeginger, editors. Online algorithms, volume 1442 of LNCS. Springer, 1998.
16. R. L. Graham. Bounds on multiprocessing anomalies and related packing algorithms. In Proc. of AFIPS. ACM, 1972.
17. T. Lappas, K. Liu, and E. Terzi. Finding a team of experts in social networks. In Proc. of KDD. ACM, 2009.
18. S. Leonardi. On-line network routing. In A. Fiat and G. J. Woeginger, editors, Online algorithms. Springer, 1998.
19. K. Mehlhorn. Assigning papers to referees. In ICALP, 2009.
20. G. Nemhauser, L. Wolsey, and M. Fisher. An analysis of the approximations for maximizing submodular set functions. Math. Programming, (14), 1978.
21. C. Shirky. Here Comes Everybody: The Power of Organizing Without Organizations. Penguin Press, 2008.
22. D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Comm. ACM, 28(2), 1985.
23. V. V. Vazirani. Approximation algorithms. Springer, 2001.
24. J. Zhang, M. S. Ackerman, and L. Adamic. Expertise networks in online communities: structure and algorithms. In Proc. of WWW, New York, NY, USA, 2007. ACM.