Simulation of trust propagation in community validated gamification

  • 1 West University of Timișoara, Romania
  • 2 Transilvania University of Brașov, Romania


The new platforms coming out on the social media space are faced from the beginning with a fierce contest. The competition for user attention is hard and the main players (Facebook, TikTok, Instagram, Reddit) have a huge advantage. To overcome these problems many of the newly lunched platform are making use of gamification strategy to keep the user engaged. The gamification strategy usually provides the user with a form of digital reputation but on some platform, it can be even a form of digital currency which can be exchanged for benefits or real products. To validate the user actions there is not always an automatic process, and the platforms are relaying on the community to cross-validate the authenticity and the value of the respective actions. The validation of the user actions can be automated but not always. When the validation cannot be automated, and the task requires human intervention the process is in his most part outsourced to the community and only a small number of the validation will be done by platform operators. The validation done by the platform operators will give credits to the users whose actions were validated. After certain amount of credit is given to a user, he became trusted, and his action can validate the actions of other users. The trusted user will act almost as a platform operator by validating other users’ actions. In this paper we simulate and analyse how the trust can be propagated into different social networks configuration. We start by defining a mathematical framework for modelling the users and the actions. After we introduce two different algorithms for propagating the trust in the community and finally for each configuration, we simulate the propagation of the trust and discuss the results.



  1. S. Deterding, R. Khaled, L. E. Nacke, D. Dixon et al., “Gamification: Toward a definition,” in CHI 2011 gamification workshop proceedings, vol. 12. Vancouver, Canada, 2011, pp. 1–79.
  2. T.F.P. AG, “Tfp: The fortunate planet”,, 2022
  3. L. C. Freeman, “A set of measures of centrality based on betweenness,” Sociometry, pp. 35–41, 1977.
  4. S. Brin and L. Page, “The anatomy of a large-scale hypertextual web search engine,” Computer networks and ISDN systems, vol. 30, no. 1-7, pp. 107–117, 1998.
  5. Y. Wang, S. Xue, J. Wu, and P. Xu, “Continuous-time quantum walk based centrality testing on weighted graphs,” Scientific Reports, vol. 12, no. 1, p. 6001, 2022.
  6. A. Hagberg, P. Swart, and D. S Chult, “Exploring network structure, dynamics, and function using networkx,” Los Alamos National Lab. (LANL), Los Alamos, NM (United States), Tech. Rep., 2008.

Article full text

Download PDF