Skip to main content
SpringerLink
Log in

A Simple Greedy Algorithm for the Profit-Aware Social Team Formation Problem

  • Conference paper
  • First Online:
Combinatorial Optimization and Applications (COCOA 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10628))

Abstract

Team formation in social networks has attracted much attention due to its many applications such as the online labour market. In this paper, we focus on the problem of forming multiple teams of experts with diverse skills in social network to accomplish complex tasks of required skills. The goal is to maximize the total profit of tasks that these teams can complete. We provide a simple and practical algorithm that improves upon previous results in many situations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Anagnostopoulos, A., Becchetti, L., Castillo, C., Gionis, A., Leonardi, S.: Power in unity: Forming teams in large-scale community systems. In: Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM), pp. 599–608 (2010)

    Google Scholar 

  2. Anagnostopoulos, A., Becchetti, L., Castillo, C., Gionis, A., Leonardi, S.: Online team formation in social networks. In: Proceedings of the International Conference on World Wide Web (WWW), pp. 839–848 (2012)

    Google Scholar 

  3. Carr, R., Vempala, S.: Randomized metarounding. Random Struct. Algorithms 20(3), 343–352 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  4. Charikar, M., Chekuri, C., Cheung, T.-Y., Dai, Z., Goel, A., Guha, S., Li, M.: Approximation algorithms for directed steiner problems. J. Algorithms 33(1), 73–91 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  5. Fortunato, S.: Community detection in graphs. Phys. Rep. 486, 75–174 (2010)

    Article  MathSciNet  Google Scholar 

  6. Gajewar, A., Sarma, A.D.: Multi-skill collaborative teams based on densest subgraphs. In: Proceedings of the SIAM International Conference on Data Mining (SDM), pp. 165–176 (2012)

    Google Scholar 

  7. Golshan, B., Lappas, T., Terzi, E.: Profit-maximizing cluster hires. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 1196–1205 (2014)

    Google Scholar 

  8. Greenwald, R.: Freelancers find it pays to team up. Wall Street J. 3 February 2014. https://www.wsj.com/articles/freelancers-find-it-pays-to-team-up-1389267711

  9. Jain, K., Mahdian, M., Salavatipour, M.R.: Packing steiner trees. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 266–274 (2003)

    Google Scholar 

  10. Kargar, M., An, A.: Discovering top-k teams of experts with/without a leader in social networks. In: Proceedings of the ACM International Conference on Information and Knowledge Management (CIKM), pp. 985–994 (2011)

    Google Scholar 

  11. Lappas, T., Liu, K., Terzi, E.: Finding a team of experts in social networks. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 467–476 (2009)

    Google Scholar 

  12. Lee, V.E., Ruan, N., Jin, R., Aggarwal, C.: A survey of algorithms for dense subgraph discovery. In: Aggarwal, C., Wang, H. (eds.) Managing and Mining Graph Data. Advances in Database Systems, vol. 40, pp. 303–336. Springer, Boston (2010). https://doi.org/10.1007/978-1-4419-6045-0_10

    Chapter  Google Scholar 

  13. Li, C.-T., Shan, M.-K., Lin, S.-D.: On team formation with expertise query in collaborative social networks. Knowl. Inf. Syst. 42(2), 441–463 (2015)

    Article  Google Scholar 

  14. Majumder, A., Datta, S., Naidu, K.V.M.: Capacitated team formation problem on social networks. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pp. 1005–1013 (2012)

    Google Scholar 

  15. Rangapuram, S.S., Bühler, T., Hein, M.: Towards realistic team formation in social networks based on densest subgraphs. In: Proceedings of the International Conference on World Wide Web (WWW), pp. 1077–1088 (2013)

    Google Scholar 

  16. Rothvoß, T.: Directed steiner tree and the lasserre hierarchy. CoRR, abs/1111.5473 (2011)

    Google Scholar 

  17. Tang, S.: Profit-aware team grouping in social networks: a generalized cover decomposition approach. CoRR, abs/1605.03205 (2016)

    Google Scholar 

  18. Tang, S.: Profit-driven team grouping in social networks. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 45–51 (2017)

    Google Scholar 

  19. Wang, X., Zhao, Z., Ng, W.: A comparative study of team formation in social networks. In: Renz, M., Shahabi, C., Zhou, X., Cheema, M.A. (eds.) DASFAA 2015. LNCS, vol. 9049, pp. 389–404. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-18120-2_23

    Google Scholar 

  20. Wang, X., Zhao, Z., Ng, W.: USTF: a unified system of team formation. IEEE Trans. Big Data 2(1), 70–84 (2016)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, City University of Hong Kong, Hong Kong, China

    Shengxin Liu

  2. School of Computing and Information Sciences, Caritas Institute of Higher Education, Hong Kong, China

    Chung Keung Poon

Authors
  1. Shengxin Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chung Keung Poon
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chung Keung Poon .

Editor information

Editors and Affiliations

  1. Shanghai Jiao Tong University, Shanghai, China

    Xiaofeng Gao

  2. Harbin Institute of Technology, Shenzhen, China

    Hongwei Du

  3. Kennesaw State University, Kennesaw, Georgia, USA

    Meng Han

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Liu, S., Poon, C.K. (2017). A Simple Greedy Algorithm for the Profit-Aware Social Team Formation Problem. In: Gao, X., Du, H., Han, M. (eds) Combinatorial Optimization and Applications. COCOA 2017. Lecture Notes in Computer Science(), vol 10628. Springer, Cham. https://doi.org/10.1007/978-3-319-71147-8_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-71147-8_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-71146-1

  • Online ISBN: 978-3-319-71147-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation