Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3457913.3457923acmotherconferencesArticle/Chapter ViewAbstractPublication PagesinternetwareConference Proceedingsconference-collections
research-article

Group Activity Matching with Blockchain Backed Credible Commitment

Published:21 July 2021Publication History

ABSTRACT

Humans are social creatures which enjoy participating in group activities. Existing platforms such as event-based social networks and social-matching applications empower people to organize and participate in different kinds of interest-based activities. However, credibility issues are inevitable since the participants’ commitment to participate in activities on time can hardly be guaranteed. As a result, many activities are canceled due to lack of participation, which impairs people’s will for attending activities and increases the difficulty of coalescing activity groups.

In this work, we propose an approach, called BC-GAM, for matching group activities with blockchain backed credible commitment. Based on a formalization of the matching problem, BC-GAM works as follows. During user requesting (for certain type of activity), the user is required to pay a variable deposit which reflects his/her level of commitment for participating in the activity. Our matching algorithm then automatically coalesces the users according to the user requests and availability of facilities. Our algorithm is designed to maximally allow the enrolled users to participate in activities based on their commitment. Furthermore, BC-GAM utilizes blockchain techniques and smart contracts so that the user requesting, commitment and participation are automatically executed in a distributed and trusted way. We implemented BC-GAM on a hyperledger and developed a user interface for requesting and inquiry of the activities. Based on the blockchain platform, we performed experiments with not only simulated data but also actual user studies. The experiment results show that the matching algorithm is effective and efficient, and BC-GAM can be potentially applied in practice.

References

  1. Majed Alrubaian, Muhammad Al-Qurishi, Atif Alamri, Mabrook Al-Rakhami, Mohammad Mehedi Hassan, and Giancarlo Fortino. 2019. Credibility in Online Social Networks: A Survey. IEEE Access 7(2019), 2828–2855.Google ScholarGoogle ScholarCross RefCross Ref
  2. Elli Androulaki, Artem Barger, Vita Bortnikov, Christian Cachin, Konstantinos Christidis, Angelo De Caro, David Michael Enyeart, Christopher Ferris, Gennady Laventman, Yacov Manevich, 2018. Hyperledger fabric: a distributed operating system for permissioned blockchains. european conference on computer systems(2018), 30.Google ScholarGoogle Scholar
  3. Mahsa Badami, Faezeh Tafazzoli, and Olfa Nasraoui. 2018. A case study for intelligent event recommendation. International Journal of Data Science and Analytics 5, 4 (2018), 249–268.Google ScholarGoogle ScholarCross RefCross Ref
  4. Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, and Luca Moscardelli. 2019. Optimality and Nash stability in additively separable generalized group activity selection problems. In Proceedings of the 28th International Joint Conference on Artificial Intelligence. AAAI Press, 102–108.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Christian Cachin. 2016. Architecture of the hyperledger blockchain fabric. In Workshop on distributed cryptocurrencies and consensus ledgers, Vol. 310.Google ScholarGoogle Scholar
  6. Christian Cachin and Marko Vukolic. 2017. Blockchains Consensus Protocols in the Wild. (2017).Google ScholarGoogle Scholar
  7. James S Coleman. 1966. Foundations for a theory of collective decisions. Amer. J. Sociology 71, 6 (1966), 615–627.Google ScholarGoogle ScholarCross RefCross Ref
  8. Andreas Darmann. 2015. Group activity selection from ordinal preferences. In International Conference on Algorithmic DecisionTheory. Springer, 35–51.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Andreas Darmann. 2018. A social choice approach to ordinal group activity selection. Mathematical Social Sciences 93 (2018), 57–66.Google ScholarGoogle ScholarCross RefCross Ref
  10. Andreas Darmann. 2018. Stable and Pareto optimal group activity selection from ordinal preferences. International Journal of Game Theory 47, 4 (2018), 1183–1209.Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Andreas Darmann. 2019. Manipulability in a group activity selection problem. Social Choice and Welfare 52, 3 (2019), 527–557.Google ScholarGoogle ScholarCross RefCross Ref
  12. Andreas Darmann, Janosch Döcker, Britta Dorn, Jérôme Lang, and Sebastian Schneckenburger. 2017. On simplified group activity selection. In International Conference on Algorithmic DecisionTheory. Springer, 255–269.Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, and Gerhard Woeginger. 2012. Group activity selection problem. In International Workshop on Internet and Network Economics. Springer, 156–169.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Andreas Darmann, Edith Elkind, Sascha Kurz, Jérôme Lang, Joachim Schauer, and Gerhard Woeginger. 2018. Group activity selection problem with approval preferences. International Journal of Game Theory 47, 3 (2018), 767–796.Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Vikram Dhillon, David Metcalf, and Max Hooper. 2017. The Hyperledger Project. (2017).Google ScholarGoogle Scholar
  16. Marco Dorigo, Mauro Birattari, and Thomas Stützle. 2006. Ant colony optimization. IEEE Comput. Intell. Mag. 1, 4 (2006), 28–39. https://doi.org/10.1109/MCI.2006.329691Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Marco Dorigo, Vittorio Maniezzo, and Alberto Colorni. 1996. Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B 26, 1 (1996), 29–41. https://doi.org/10.1109/3477.484436Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Robert Ganian, Sebastian Ordyniak, and C. S. Rahul. 2019. Group Activity Selection with Few Agent Types. In 27th Annual European Symposium on Algorithms (ESA 2019)(Leibniz International Proceedings in Informatics (LIPIcs), Vol. 144), Michael A. Bender, Ola Svensson, and Grzegorz Herman (Eds.). Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 48:1–48:16. https://doi.org/10.4230/LIPIcs.ESA.2019.48Google ScholarGoogle Scholar
  19. Joey Chiao-Yin Hsiao and Tawanna R Dillahunt. 2017. People-nearby applications: How newcomers move their relationships offline and develop social and cultural capital. In Proceedings of the 2017 ACM Conference on Computer Supported Cooperative Work and Social Computing. ACM, 26–40.Google ScholarGoogle Scholar
  20. Ayumi Igarashi, Dominik Peters, and Edith Elkind. 2017. Group activity selection on social networks. In Thirty-First AAAI Conference on Artificial Intelligence.Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Harold W. Kuhn. 2010. The Hungarian Method for the Assignment Problem. In 50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art, Michael Jünger, Thomas M. Liebling, Denis Naddef, George L. Nemhauser, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, and Laurence A. Wolsey (Eds.). Springer, 29–47. https://doi.org/10.1007/978-3-540-68279-0_2Google ScholarGoogle Scholar
  22. Xingjie Liu, Qi He, Yuanyuan Tian, Wang-Chien Lee, John McPherson, and Jiawei Han. 2012. Event-based social networks: linking the online and offline social worlds. In Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, 1032–1040.Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Yacov Manevich, Artem Barger, and Yoav Tock. 2018. Service Discovery for Hyperledger Fabric. (2018).Google ScholarGoogle Scholar
  24. Julia M Mayer, Starr Roxanne Hiltz, and Quentin Jones. 2015. Making social matching context-aware: Design concepts and open challenges. In Proceedings of the 33rd Annual ACM Conference on Human Factors in Computing Systems. ACM, 545–554.Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Tunde J Ogundele, Chi-Yin Chow, and Jia-Dong Zhang. 2017. Eventrec: Personalized event recommendations for smart event-based social networks. In 2017 IEEE International Conference on Smart Computing (SMARTCOMP). IEEE, 1–8.Google ScholarGoogle ScholarCross RefCross Ref
  26. Tunde Joseph Ogundele, Chi-Yin Chow, and Jia-Dong Zhang. 2018. SoCaST*: Personalized Event Recommendations for Event-Based Social Networks: A Multi-Criteria Decision Making Approach. IEEE Access 6(2018), 27579–27592.Google ScholarGoogle ScholarCross RefCross Ref
  27. Pamela Oliver, Gerald Marwell, and Ruy Teixeira. 1985. A theory of the critical mass. I. Interdependence, group heterogeneity, and the production of collective action. American journal of Sociology 91, 3 (1985), 522–556.Google ScholarGoogle ScholarCross RefCross Ref
  28. Robert D Putnam. 2000. Bowling alone: American declining social capital. In Culture and politics. Springer, 223–234.Google ScholarGoogle ScholarCross RefCross Ref
  29. Stephen Ricken, Louise Barkhuus, and Quentin Jones. 2017. Going online to meet offline: Organizational practices of social activities through meetup. In Proceedings of the 8th International Conference on Communities and Technologies. ACM, 139–148.Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Stephen Ricken, Sukeshini Grandhi, Doug Zytko, Starr Roxanne Hiltz, and Quentin Jones. 2014. Anyone for Bowling?: Coalescing for Shared Activities. In Proceedings of the 18th International Conference on Supporting Group Work. ACM, 122–130.Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Wanita Sherchan, Surya Nepal, and Cecile Paris. 2013. A survey of trust in social networks. ACM Computing Surveys (CSUR) 45, 4 (2013), 47.Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Loren Terveen and David W McDonald. 2005. Social matching: A framework and research agenda. ACM transactions on computer-human interaction (TOCHI) 12, 3(2005), 401–434.Google ScholarGoogle Scholar
  33. Chad Van De Wiele and Stephanie Tom Tong. 2014. Breaking boundaries: The uses & gratifications of Grindr. In Proceedings of the 2014 ACM international joint conference on pervasive and ubiquitous computing. ACM, 619–630.Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Wouter Weerkamp and Maarten de Rijke. 2012. Credibility-inspired ranking for blog post retrieval. Information retrieval 15, 3-4 (2012), 243–277.Google ScholarGoogle Scholar
  35. Douglas Zytko, Stephen Ricken, Brian Butler, and Quentin Jones. 2019. Bowling Together Again: Facilitating the Initiation of Collective Action through Awareness of Others. In Proceedings of the 52nd Hawaii International Conference on System Sciences.Google ScholarGoogle ScholarCross RefCross Ref
  36. Douglas Zytko, Stephen Ricken, and Quentin Jones. 2018. Group-Activity Organizing Through an Awareness-of-Others Interface. In Companion of the 2018 ACM Conference on Computer Supported Cooperative Work and Social Computing. ACM, 361–364.Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Group Activity Matching with Blockchain Backed Credible Commitment
      Index terms have been assigned to the content through auto-classification.

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Other conferences
        Internetware '20: Proceedings of the 12th Asia-Pacific Symposium on Internetware
        November 2020
        264 pages
        ISBN:9781450388191
        DOI:10.1145/3457913

        Copyright © 2020 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 21 July 2021

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
        • Research
        • Refereed limited

        Acceptance Rates

        Overall Acceptance Rate55of111submissions,50%
      • Article Metrics

        • Downloads (Last 12 months)9
        • Downloads (Last 6 weeks)4

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      HTML Format

      View this article in HTML Format .

      View HTML Format