ELO System for Skat and Other Games of Chance

• URL: http://arxiv.org/abs/2104.05422v1
• Date: Wed, 7 Apr 2021 08:30:01 GMT
• Title: ELO System for Skat and Other Games of Chance
• Authors: Stefan Edelkamp
• Abstract summary: The evaluation of player strength in trick-taking card games like Skat or Bridge is not obvious. We propose a new ELO system for Skat to overcome these weaknesses.
• Score: 1.3706331473063877
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Assessing the skill level of players to predict the outcome and to rank the players in a longer series of games is of critical importance for tournament play. Besides weaknesses, like an observed continuous inflation, through a steadily increasing playing body, the ELO ranking system, named after its creator Arpad Elo, has proven to be a reliable method for calculating the relative skill levels of players in zero-sum games. The evaluation of player strength in trick-taking card games like Skat or Bridge, however, is not obvious. Firstly, these are incomplete information partially observable games with more than one player, where opponent strength should influence the scoring as it does in existing ELO systems. Secondly, they are game of both skill and chance, so that besides the playing strength the outcome of a game also depends on the deal. Last but not least, there are internationally established scoring systems, in which the players are used to be evaluated, and to which ELO should align. Based on a tournament scoring system, we propose a new ELO system for Skat to overcome these weaknesses.

Related papers

• Leading the Pack: N-player Opponent Shaping [52.682734939786464]
  We extend Opponent Shaping (OS) methods to environments involving multiple co-players and multiple shaping agents. We find that when playing with a large number of co-players, OS methods' relative performance reduces, suggesting that in the limit OS methods may not perform well.
  arXiv  Detail & Related papers  (2023-12-19T20:01:42Z)
• Understanding why shooters shoot -- An AI-powered engine for basketball performance profiling [70.54015529131325]
  Basketball is dictated by many variables, such as playstyle and game dynamics. It is crucial that the performance profiles can reflect the diverse playstyles. We present a tool that can visualize player performance profiles in a timely manner.
  arXiv  Detail & Related papers  (2023-03-17T01:13:18Z)
• GCN-WP -- Semi-Supervised Graph Convolutional Networks for Win Prediction in Esports [84.55775845090542]
  We propose a semi-supervised win prediction model for esports based on graph convolutional networks. GCN-WP integrates over 30 features about the match and players and employs graph convolution to classify games based on their neighborhood. Our model achieves state-of-the-art prediction accuracy when compared to machine learning or skill rating models for LoL.
  arXiv  Detail & Related papers  (2022-07-26T21:38:07Z)
• On the Limitations of Elo: Real-World Games, are Transitive, not Additive [13.334776744099285]
  We show that Elo models can fail to extract the strength of the transitive component in games. We propose an extension of the Elo score that assigns each player two scores, which we refer to as skill and consistency.
  arXiv  Detail & Related papers  (2022-06-21T22:07:06Z)
• Collusion Detection in Team-Based Multiplayer Games [57.153233321515984]
  We propose a system that detects colluding behaviors in team-based multiplayer games. The proposed method analyzes the players' social relationships paired with their in-game behavioral patterns. We then automate the detection using Isolation Forest, an unsupervised learning technique specialized in highlighting outliers.
  arXiv  Detail & Related papers  (2022-03-10T02:37:39Z)
• Learning to Identify Top Elo Ratings: A Dueling Bandits Approach [27.495132915328025]
  We propose an efficient online match scheduling algorithm to improve the sample efficiency of the Elo evaluation (for top players) Specifically, we identify and match the top players through a dueling bandits framework and tailor the bandit algorithm to the gradient-based update of Elo. Our algorithm has a regret guarantee $tildeO(sqrtT)$, sublinear in the number of competition rounds and has been extended to the multidimensional Elo ratings.
  arXiv  Detail & Related papers  (2022-01-12T13:57:29Z)
• Evaluating Team Skill Aggregation in Online Competitive Games [4.168733556014873]
  We present an analysis of the impact of two new aggregation methods on the predictive performance of rating systems. Our evaluations show the superiority of the MAX method over the other two methods in the majority of the tested cases. Results of this study highlight the necessity of devising more elaborated methods for calculating a team's performance.
  arXiv  Detail & Related papers  (2021-06-21T20:17:36Z)
• Elo Ratings for Large Tournaments of Software Agents in Asymmetric Games [0.0]
  It is natural to evaluate artificial intelligence agents on the same Elo scale as humans, such as the rating of 5185 attributed to AlphaGo Zero. There are several fundamental differences between humans and AI that suggest modifications to the system. We present a revised rating system, and guidelines for tournaments, to reflect these differences.
  arXiv  Detail & Related papers  (2021-04-23T21:49:20Z)
• Generating Diverse and Competitive Play-Styles for Strategy Games [58.896302717975445]
  We propose Portfolio Monte Carlo Tree Search with Progressive Unpruning for playing a turn-based strategy game (Tribes) We show how it can be parameterized so a quality-diversity algorithm (MAP-Elites) is used to achieve different play-styles while keeping a competitive level of play. Our results show that this algorithm is capable of achieving these goals even for an extensive collection of game levels beyond those used for training.
  arXiv  Detail & Related papers  (2021-04-17T20:33:24Z)
• L2E: Learning to Exploit Your Opponent [66.66334543946672]
  We propose a novel Learning to Exploit framework for implicit opponent modeling. L2E acquires the ability to exploit opponents by a few interactions with different opponents during training. We propose a novel opponent strategy generation algorithm that produces effective opponents for training automatically.
  arXiv  Detail & Related papers  (2021-02-18T14:27:59Z)
• An Elo-like System for Massive Multiplayer Competitions [1.8782750537161612]
  We present a novel Bayesian rating system for contests with many participants. It is widely applicable to competition formats with discrete ranked matches. We show that the system aligns incentives: that is, a player who seeks to maximize their rating will never want to underperform.
  arXiv  Detail & Related papers  (2021-01-02T08:14:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.