{"title":"Identifying Power Elites in Massively Multiplayer Online Games by Applying Machine Learning to Communication and Support Networks","authors":"S. Müller, Raji Ghawi, Jürgen Pfeffer","doi":"10.1109/ASONAM55673.2022.10068676","DOIUrl":null,"url":null,"abstract":"The aim of this paper is to show how machine learning can predict whether an individual is more powerful than others in the group. The crucial point here is to consider the structural position of the actors in the social networks in which they are embedded. The approach we have taken for constructing these intra-group networks is the aggregation of communication and support interactions. Our research is based on longitutional data from the Massively Multiplayer Online Game (MMOG) Travian that was collected over a 12-month period. The data includes 202,764 communication and 96,913 support interactions between players that we applied for the construction of interaction networks. We also had access to status information on a daily basis for 21,431 individual players who were members of 4,758 alliances. Methodically, we applied 10 established metrics from SNA-based team research in combination with the Random Forstest classification algorithm. Our results show that interaction networks are well suited to assign members into two groups of powerful (elite) and nonpowerful (non-elite) players. It turned out that the identification of non-elite members was much easier to accomplish than that of elite members. Regarding the application of multiplex networks, we could not confirm a higher explanatory power by using combined networks. In summary, we can say that the network patterns of elite members are clearly different from those of non-elite members. In this way, we were able to predict affiliation to each category with an accuracy (F1) of 0.88 for communication networks and 0.83 for support networks.","PeriodicalId":423113,"journal":{"name":"2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASONAM55673.2022.10068676","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The aim of this paper is to show how machine learning can predict whether an individual is more powerful than others in the group. The crucial point here is to consider the structural position of the actors in the social networks in which they are embedded. The approach we have taken for constructing these intra-group networks is the aggregation of communication and support interactions. Our research is based on longitutional data from the Massively Multiplayer Online Game (MMOG) Travian that was collected over a 12-month period. The data includes 202,764 communication and 96,913 support interactions between players that we applied for the construction of interaction networks. We also had access to status information on a daily basis for 21,431 individual players who were members of 4,758 alliances. Methodically, we applied 10 established metrics from SNA-based team research in combination with the Random Forstest classification algorithm. Our results show that interaction networks are well suited to assign members into two groups of powerful (elite) and nonpowerful (non-elite) players. It turned out that the identification of non-elite members was much easier to accomplish than that of elite members. Regarding the application of multiplex networks, we could not confirm a higher explanatory power by using combined networks. In summary, we can say that the network patterns of elite members are clearly different from those of non-elite members. In this way, we were able to predict affiliation to each category with an accuracy (F1) of 0.88 for communication networks and 0.83 for support networks.