Adapting Rules of Official International Mahjong for Online Players

• URL: http://arxiv.org/abs/2601.08211v1
• Date: Tue, 13 Jan 2026 04:36:05 GMT
• Title: Adapting Rules of Official International Mahjong for Online Players
• Abstract summary: We employ a world champion AI to engage in self-play competitions and conduct statistical data analysis.<n>Based on our findings, we propose rule adaptations to make the game more suitable for the online environment.<n>This work is an initial attempt to use data from AI systems to evaluate Official Internatinoal Mahjong's game balance.
• Score: 3.9039720954900243
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: As one of the worldwide spread traditional game, Official International Mahjong can be played and promoted online through remote devices instead of requiring face-to-face interaction. However, online players have fragmented playtime and unfixed combination of opponents in contrary to offline players who have fixed opponents for multiple rounds of play. Therefore, the rules designed for offline players need to be modified to ensure the fairness of online single-round play. Specifically, We employ a world champion AI to engage in self-play competitions and conduct statistical data analysis. Our study reveals the first-mover advantage and issues in the subgoal scoring settings. Based on our findings, we propose rule adaptations to make the game more suitable for the online environment, such as introducing compensatory points for the first-mover advantage and refining the scores of subgoals for different tile patterns. Compared with the traditional method of rotating positions over multiple rounds to balance first-mover advantage, our compensatory points mechanism in each round is more convenient for online players. Furthermore, we implement the revised Mahjong game online, which is open for online players. This work is an initial attempt to use data from AI systems to evaluate Official Internatinoal Mahjong's game balance and develop a revised version of the traditional game better adapted for online players.

Related papers

• CHAMP: Cross-domain Hybrid Architecture for Matchmaking and Prediction in Online Multi-Player Games [11.51314302493261]
  Multiplayer Online Battle Arena (MOBA) games rely on matchmaking to maintain competitive balance.<n>We present CHAMP, a cross-domain matchmaking framework that resolves deployment bottlenecks.<n>CHAMP replaces the target-mode-only player profile with a hybrid domain feature collection.<n>It achieves 67.73% win-rate prediction accuracy, outperforming all evaluated attention and sequence baselines.
  arXiv  Detail & Related papers  (2026-09-04T08:30:29Z)
• CUPID: Improving Battle Fairness and Position Satisfaction in Online MOBA Games with a Re-matchmaking System [38.36310386543932]
  CUPID aims to optimize team and position assignments to improve both fairness and player satisfaction. It incorporates a pre-filtering step to ensure a minimum level of matchmaking quality, followed by a pre-match win-rate prediction model. Experiments were conducted on two large-scale, real-world MOBA datasets to validate the effectiveness of CUPID.
  arXiv  Detail & Related papers  (2024-06-28T08:09:55Z)
• Offline Fictitious Self-Play for Competitive Games [28.019581365721677]
  Offline Reinforcement Learning (RL) enables policy improvement from fixed datasets without online interactions.<n>This paper introduces OFF-FSP, the first model-free offline RL algorithm for competitive games.<n>Experiments on matrix games, extensive-form poker, and board games demonstrate that OFF-FSP achieves significantly lower exploitability than state-of-the-art baselines.
  arXiv  Detail & Related papers  (2024-02-29T11:36:48Z)
• All by Myself: Learning Individualized Competitive Behaviour with a Contrastive Reinforcement Learning optimization [57.615269148301515]
  In a competitive game scenario, a set of agents have to learn decisions that maximize their goals and minimize their adversaries' goals at the same time. We propose a novel model composed of three neural layers that learn a representation of a competitive game, learn how to map the strategy of specific opponents, and how to disrupt them. Our experiments demonstrate that our model achieves better performance when playing against offline, online, and competitive-specific models, in particular when playing against the same opponent multiple times.
  arXiv  Detail & Related papers  (2023-10-02T08:11:07Z)
• Three-Player Game Training Dynamics [77.34726150561087]
  We explore three-player game training dynamics using an extended version of a simplified bilinear smooth game. We find that trilinear games do not converge on the Nash equilibrium in most cases. In addition to alternating and simultaneous updates, we explore a new update order--maximizer-first---which is only possible in a three-player game.
  arXiv  Detail & Related papers  (2022-08-12T23:57:44Z)
• 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)
• Bayesian Learning of Play Styles in Multiplayer Video Games [0.0]
  We develop a hierarchical Bayesian regression approach for the online multiplayer game Battlefield 3. We discover common play styles amongst our sample of Battlefield 3 players. We find groups of players that exhibit overall high performance, as well as groupings of players that perform particularly well in specific game types, maps and roles.
  arXiv  Detail & Related papers  (2021-12-14T14:48:24Z)
• Discovering Multi-Agent Auto-Curricula in Two-Player Zero-Sum Games [31.97631243571394]
  We introduce a framework, LMAC, that automates the discovery of the update rule without explicit human design. Surprisingly, even without human design, the discovered MARL algorithms achieve competitive or even better performance. We show that LMAC is able to generalise from small games to large games, for example training on Kuhn Poker and outperforming PSRO.
  arXiv  Detail & Related papers  (2021-06-04T22:30:25Z)
• 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)
• Learning to Play Sequential Games versus Unknown Opponents [93.8672371143881]
  We consider a repeated sequential game between a learner, who plays first, and an opponent who responds to the chosen action. We propose a novel algorithm for the learner when playing against an adversarial sequence of opponents. Our results include algorithm's regret guarantees that depend on the regularity of the opponent's response.
  arXiv  Detail & Related papers  (2020-07-10T09:33:05Z)
• Competitive Balance in Team Sports Games [8.321949054700086]
  We show that using final score difference provides yet a better prediction metric for competitive balance. We also show that a linear model trained on a carefully selected set of team and individual features achieves almost the performance of the more powerful neural network model.
  arXiv  Detail & Related papers  (2020-06-24T14:19:07Z)
• Suphx: Mastering Mahjong with Deep Reinforcement Learning [114.68233321904623]
  We design an AI for Mahjong, named Suphx, based on deep reinforcement learning with some newly introduced techniques. Suphx has demonstrated stronger performance than most top human players in terms of stable rank. This is the first time that a computer program outperforms most top human players in Mahjong.
  arXiv  Detail & Related papers  (2020-03-30T16:18:16Z)

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.