Social Network Analysis applied to Marvel Crisis Protocol
Resumo
Introduction: Social Network Analysis (SNA) based on Graph Theory has proven to be a powerful tool for modeling and understanding interactions in various contexts. In this study, we apply SNA to examine the connections and synergies between characters in the Marvel Crisis Protocol (MCP) miniatures game, a tabletop miniatures game where players form teams of Marvel heroes and villains based on abilities, affiliations, and strategic synergies. Objective: This study aims to analyze the undefeated lists of the tournaments in the first quarter of 2025 and verify if there is any competitive advantage in using the most influential characters according to the centrality measures of Graph Theory. Methodology or Steps: For this purpose, a simulation of a Social Network Analysis was carried out using the characters’ Affiliations as a basis using five centrality measures. Results: After identifying the influential characters, a comparison was made with the undefeated lists to verify whether such characters make up the winning rosters and if using a team with two Affiliations is a good strategy. Unfortunately, single Affiliations roosters performed better in the championships analyzed.
Referências
Atomic Mass, G. (2019). Mcp. [link]. Accessed: 2025-03-10.
Atomic Mass, G. (2025a). Affiliations. [link]. Accessed: 2025-03-10.
Atomic Mass, G. (2025b). Rules. [link]. Accessed: 2025-03-10.
Barnett, J. H. (2005). Early writings on graph theory: Euler circuits and the königsberg bridge problem. Part II: Historical Projects in Discrete Mathematics and Computer Science of Resources for Teaching Discrete Mathematics: Classroom Project, History Modules, and Articles, MAA Notes, 74:197–208.
Buthaud, M. (2022). Wargames as realistic tabletop simulations of fictional events: The case of warhammer games.
Campbell, W. M., Dagli, C. K., e Weinstein, C. J. (2013). Social network analysis with content and graphs. Lincoln Laboratory Journal, 20(1):61–81.
Carter, M., Gibbs, M., e Harrop, M. (2014). Drafting an army: The playful pastime of warhammer 40,000. Games and Culture, 9(2):122–147.
dos Santos Simões-Pereira, J. M. (2013). Grafos e redes: teoria e algoritmos básicos. Interciência.
Goldenberg, D. (2021). Social network analysis: From graph theory to applications with python. arXiv preprint arXiv:2102.10014.
Hagberg, A., Swart, P., e S Chult, D. (2008). Exploring network structure, dynamics, and function using networkx. Technical report, Los Alamos National Lab.(LANL), Los Alamos, NM (United States).
Harrop, M., Gibbs, M. R., e Carter, M. (2013). Everyone’s a winner at warhammer 40k (or, at least not a loser). In DiGRA Conference.
ICv2 (2023). Sales. [link]. Accessed: 2025-03-19.
Kostić, S. M., Simić, M. I., e Kostić, M. V. (2020). Social network analysis and churn prediction in telecommunications using graph theory. Entropy, 22(7):753.
Latora, V. e Marchiori, M. (2007). A measure of centrality based on network efficiency. New Journal of Physics, 9(6):188.
Majeed, A. e Rauf, I. (2020). Graph theory: A comprehensive survey about graph theory applications in computer science and social networks. Inventions, 5(1):10.
Pachayappan, M., Venkatesakumar, R., et al. (2018). A graph theory based systematic literature network analysis. Theoretical Economics Letters, 8(05):960.
Provost, F. e Fawcett, T. (2013). Data Science for Business: What you need to know about data mining and data-analytic thinking. " O’Reilly Media, Inc.".
