IDEAS home Printed from https://ideas.repec.org/a/eee/tefoso/v176y2022ics0040162521008969.html
   My bibliography  Save this article

Dynamic group formation in an online social network

Author

Listed:
  • Ramjattan, Reshawn
  • Hosein, Nicholas
  • Hosein, Patrick
  • Knoesen, Andre

Abstract

For those seeking to recruit teammates for a specific purpose, like a project or study group, challenges quickly arise once they have exhausted their social circle. In the wake of the current pandemic, meeting new people that are right for a specific team is even more difficult than before due to the lack of in-person events. On social media platforms, users often have large networks of connections but have very few close personal relationships within them. This makes it difficult to find compatible people that share the same goal, and are interested in niche groups on those platforms. We present a scalable framework for establishing small online groups that balance two objectives, making the best group recommendations to users and guiding group hosts to the best users for their group. We illustrate this framework using three use cases. Lastly, we evaluate a serverless implementation using a large social media dataset to simulate a production environment and compare our framework to a network flow approach to solving the problem.

Suggested Citation

  • Ramjattan, Reshawn & Hosein, Nicholas & Hosein, Patrick & Knoesen, Andre, 2022. "Dynamic group formation in an online social network," Technological Forecasting and Social Change, Elsevier, vol. 176(C).
  • Handle: RePEc:eee:tefoso:v:176:y:2022:i:c:s0040162521008969
    DOI: 10.1016/j.techfore.2021.121461
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0040162521008969
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.techfore.2021.121461?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. H. W. Kuhn, 1955. "The Hungarian method for the assignment problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 2(1‐2), pages 83-97, March.
    2. Daniel Delahaye & Supatcha Chaimatanan & Marcel Mongeau, 2019. "Simulated Annealing: From Basics to Applications," International Series in Operations Research & Management Science, in: Michel Gendreau & Jean-Yves Potvin (ed.), Handbook of Metaheuristics, edition 3, chapter 0, pages 1-35, Springer.
    3. Gunter J. Hitsch & Ali Hortaçsu & Dan Ariely, 2010. "Matching and Sorting in Online Dating," American Economic Review, American Economic Association, vol. 100(1), pages 130-163, March.
    4. Gelareh, Shahin & Monemi, Rahimeh Neamatian & Semet, Frédéric & Goncalves, Gilles, 2016. "A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints," European Journal of Operational Research, Elsevier, vol. 249(3), pages 1144-1152.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Kraus, Sascha & Kumar, Satish & Lim, Weng Marc & Kaur, Jaspreet & Sharma, Anuj & Schiavone, Francesco, 2023. "From moon landing to metaverse: Tracing the evolution of Technological Forecasting and Social Change," Technological Forecasting and Social Change, Elsevier, vol. 189(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Weiqiang Shen & Chuanlin Zhang & Xiaona Zhang & Jinglun Shi, 2019. "A fully distributed deployment algorithm for underwater strong k-barrier coverage using mobile sensors," International Journal of Distributed Sensor Networks, , vol. 15(4), pages 15501477198, April.
    2. Bo Cowgill & Jonathan M. V. Davis & B. Pablo Montagnes & Patryk Perkowski, 2024. "Stable Matching on the Job? Theory and Evidence on Internal Talent Markets," CESifo Working Paper Series 11120, CESifo.
    3. Herrenbrueck, Lucas & Xia, Xiaoyu & Eastwick, Paul & Hui, Chin Ming, 2018. "Smart-dating in speed-dating: How a simple Search model can explain matching decisions," European Economic Review, Elsevier, vol. 106(C), pages 54-76.
    4. Herings, P. Jean-Jacques & Mauleon, Ana & Vannetelbosch, Vincent, 2020. "Matching with myopic and farsighted players," Journal of Economic Theory, Elsevier, vol. 190(C).
    5. Michael Bates & Michael Dinerstein & Andrew C. Johnston & Isaac Sorkin, 2022. "Teacher Labor Market Equilibrium and Student Achievement," CESifo Working Paper Series 9551, CESifo.
    6. Liang Chen & Eugene Choo & Alfred Galichon & Simon Weber, 2023. "Existence of a Competitive Equilibrium with Substitutes, with Applications to Matching and Discrete Choice Models," Papers 2309.11416, arXiv.org.
    7. Saurabh A. Lall & Li-Wei Chen & Dyana P. Mason, 2023. "Digital platforms and entrepreneurial support: a field experiment in online mentoring," Small Business Economics, Springer, vol. 61(2), pages 631-654, August.
    8. Bruze, Gustaf, 2010. "New Evidence on the Causes of Educational Homogamy," Working Papers 10-18, University of Aarhus, Aarhus School of Business, Department of Economics.
    9. András Frank, 2005. "On Kuhn's Hungarian Method—A tribute from Hungary," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(1), pages 2-5, February.
    10. Trevon D. Logan & Manisha Shah, 2013. "Face Value: Information and Signaling in an Illegal Market," Southern Economic Journal, John Wiley & Sons, vol. 79(3), pages 529-564, January.
    11. Weihua Yang & Xu Zhang & Xia Wang, 2024. "The Wasserstein Metric between a Discrete Probability Measure and a Continuous One," Mathematics, MDPI, vol. 12(15), pages 1-13, July.
    12. Amit Kumar & Anila Gupta, 2013. "Mehar’s methods for fuzzy assignment problems with restrictions," Fuzzy Information and Engineering, Springer, vol. 5(1), pages 27-44, March.
    13. Christoph Safferling & Aaron Lowen, 2011. "Economics in the Kingdom of Loathing: Analysis of Virtual Market Data," Working Paper Series of the Department of Economics, University of Konstanz 2011-30, Department of Economics, University of Konstanz.
    14. Alfred Galichon & Bernard Salanié, 2022. "Cupid’s Invisible Hand: Social Surplus and Identification in Matching Models," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 89(5), pages 2600-2629.
    15. Xu, Yujing & Yang, Huanxing, 2019. "Targeted search with horizontal differentiation in the marriage market," Journal of Economic Behavior & Organization, Elsevier, vol. 164(C), pages 31-62.
    16. Zhang, Dapeng & (Cara) Wang, Xiaokun, 2018. "Understanding many-to-many matching relationship and its correlation with joint response," Transportation Research Part B: Methodological, Elsevier, vol. 108(C), pages 249-260.
    17. Seo-Young Cho, 2014. "International Marriage for Homogeneity? - Evidence from Marriage Migration in South Korea," MAGKS Papers on Economics 201452, Philipps-Universität Marburg, Faculty of Business Administration and Economics, Department of Economics (Volkswirtschaftliche Abteilung).
    18. Jose H. Blanchet & Martin I. Reiman & Viragh Shah & Lawrence M. Wein & Linjia Wu, 2020. "Asymptotically Optimal Control of a Centralized Dynamic Matching Market with General Utilities," Papers 2002.03205, arXiv.org, revised Jun 2021.
    19. Alfred Galichon & Bernard Salanié, 2010. "Matching with Trade-offs: Revealed Preferences over Competiting Characteristics," Working Papers hal-00473173, HAL.
    20. Nisse, Nicolas & Salch, Alexandre & Weber, Valentin, 2023. "Recovery of disrupted airline operations using k-maximum matching in graphs," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1061-1072.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:tefoso:v:176:y:2022:i:c:s0040162521008969. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.sciencedirect.com/science/journal/00401625 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.