Complexity of Popularity and Dynamics of Within-Game Achievements in Computer Games
Leonardo Ribeiro da Cunha, Leonardo Oliveira Mendes, Renio dos Santos, Mendes

TL;DR
This study analyzes the complexity and player persistence in achieving in-game tasks using data from Steam, revealing log-normal distributions and human preferences for intermediate challenge levels.
Contribution
It provides the first comprehensive analysis of achievement distribution and player persistence in online games, highlighting the role of memoryless statistical functions.
Findings
Achievement counts follow a log-normal distribution.
Player numbers per game also follow a log-normal distribution.
Players prefer games with moderate persistence requirements.
Abstract
Tasks of different nature and difficulty levels are a part of people's lives. In this context, there is a scientific interest in the relationship between the difficulty of the task and the persistence need to accomplish it. Despite the generality of this problem, some tasks can be simulated in the form of games. In this way, we employ data from a large online platform, called Steam, to analyze games and the performance of their players. More specifically, we investigated persistence in completing tasks based on the proportion of players who accomplished game achievements. Overall, we present five major findings. First, the probability distribution for the number of achievements is log-normal distribution. Second, the distribution of game players also follows a log-normal. Third, most games require neither a very high degree of persistence nor a very low one. Fourth, players also prefer…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
