Fuzzy Multiset Clustering for Metagame Analysis

Developing agents for automated game playing is a demanding task in the general game production cycle. Especially the involvement of frequent balance changes after the release, which for example often occur in collectible card games, require constant updates of the developed agent. The game’s developers need to continuously analyze and understand the current meta-game for adjusting the agent’s parameters, making balance changes to the game, and, thereby, sustaining the satisfaction of its player base. The underlying analysis largely depends on evaluating players’ play traces. Necessary adjustments to the agent’s and the game’s parameters are taken care of by the game’s developers. This paper proposes a first step in automatically observing the current state of a collectible card game, which will assist the developers in their understanding of established deck archetypes and, therefore, speed up the update cycle. Fuzzy multisets are used for modeling decks and frequently occurring subsets of cards. We propose the definition of a (fuzzy) multiset centroid to uniquely represent the cluster and its contained decks and show that it is better able to match the deck archetype than the often reported deck core. The proposed clustering procedure identifies deck archetypes and keeps track of its common variants in the current meta-game. We evaluate the approach by comparing the result of our clustering procedure with a hand-labeled data set and show that it is able to reproduce clusters of similar quality to a labeling provided by experts.

[1]  Frank Klawonn,et al.  Guide to Intelligent Data Analysis - How to Intelligently Make Sense of Real Data , 2010, Texts in Computer Science.

[2]  M. Levandowsky,et al.  Distance between Sets , 1971, Nature.

[3]  Christian Borgelt,et al.  Computational Intelligence , 2016, Texts in Computer Science.

[4]  Nathan R. Sturtevant,et al.  Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search , 2010, AAAI.

[5]  Christian Borgelt,et al.  Agglomerative Fuzzy Clustering , 2016, SMPS.

[6]  Charu C. Aggarwal,et al.  Data Clustering: Algorithms and Applications , 2014 .

[7]  Sadaaki Miyamoto,et al.  Fuzzy Multisets and Their Generalizations , 2000, WMP.

[8]  Rudolf Kruse,et al.  A decision heuristic for Monte Carlo tree search doppelkopf agents , 2017, 2017 IEEE Symposium Series on Computational Intelligence (SSCI).

[9]  Malte Helmert,et al.  A Doppelkopf Player Based on UCT , 2015, KI.

[10]  宮本 定明 Algorithms for fuzzy clustering : methods in c-means clustering with applications , 2008 .

[11]  Julia Hirschberg,et al.  V-Measure: A Conditional Entropy-Based External Cluster Evaluation Measure , 2007, EMNLP.

[12]  R. Yager ON THE THEORY OF BAGS , 1986 .

[13]  Rudolf Kruse,et al.  Predicting Opponent Moves for Improving Hearthstone AI , 2018, IPMU.

[14]  Peter I. Cowling,et al.  Determinization and information set Monte Carlo Tree Search for the card game Dou Di Zhu , 2011, 2011 IEEE Conference on Computational Intelligence and Games (CIG'11).