Luck, skill, and depth of competition in games and social hierarchies

• URL: http://arxiv.org/abs/2312.04711v1
• Date: Thu, 7 Dec 2023 21:42:44 GMT
• Title: Luck, skill, and depth of competition in games and social hierarchies
• Authors: Maximilian Jerdee, M. E. J. Newman
• Abstract summary: We find that social competition tends to be "deep," meaning it has a pronounced hierarchy with many distinct levels. In most cases there is little evidence of upset wins, beyond those already implied by the shallowness of the hierarchy.
• Score: 0.6345523830122168
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Patterns of wins and losses in pairwise contests, such as occur in sports and games, consumer research and paired comparison studies, and human and animal social hierarchies, are commonly analyzed using probabilistic models that allow one to quantify the strength of competitors or predict the outcome of future contests. Here we generalize this approach to incorporate two additional features: an element of randomness or luck that leads to upset wins, and a "depth of competition" variable that measures the complexity of a game or hierarchy. Fitting the resulting model to a large collection of data sets we estimate depth and luck in a range of games, sports, and social situations. In general, we find that social competition tends to be "deep," meaning it has a pronounced hierarchy with many distinct levels, but also that there is often a nonzero chance of an upset victory, meaning that dominance challenges can be won even by significant underdogs. Competition in sports and games, by contrast, tends to be shallow and in most cases there is little evidence of upset wins, beyond those already implied by the shallowness of the hierarchy.

Related papers

• Personalized Contest Recommendation in Fantasy Sports [0.3984581084039074]
  This paper presents a scalable contest recommendation system, powered by a Wide and Deep Interaction Ranker (WiDIR) at its core.<n>Online experiments show a marked improvement over other candidate models in terms of recall and other critical business metrics.
  arXiv  Detail & Related papers  (2025-08-11T07:22:33Z)
• Seeding for Success: Skill and Stochasticity in Tabletop Games [0.0]
  Games often incorporate random elements in the form of dice or shuffled card decks. This randomness is a key contributor to the player experience and the variety of game situations encountered. There is a tension between a level of randomness that makes the game interesting and contributes to the player enjoyment of a game, and a level at which the outcome itself is effectively random and the game becomes dull.
  arXiv  Detail & Related papers  (2025-03-04T14:58:59Z)
• Securing Equal Share: A Principled Approach for Learning Multiplayer Symmetric Games [21.168085154982712]
  equilibria in multiplayer games are neither unique nor non-exploitable. This paper takes an initial step towards addressing these challenges by focusing on the natural objective of equal share. We design a series of efficient algorithms, inspired by no-regret learning, that provably attain approximate equal share across various settings.
  arXiv  Detail & Related papers  (2024-06-06T15:59:17Z)
• CompeteSMoE -- Effective Training of Sparse Mixture of Experts via Competition [52.2034494666179]
  Sparse mixture of experts (SMoE) offers an appealing solution to scale up the model complexity beyond the mean of increasing the network's depth or width. We propose a competition mechanism to address this fundamental challenge of representation collapse. By routing inputs only to experts with the highest neural response, we show that, under mild assumptions, competition enjoys the same convergence rate as the optimal estimator.
  arXiv  Detail & Related papers  (2024-02-04T15:17:09Z)
• Benchmarking Robustness and Generalization in Multi-Agent Systems: A Case Study on Neural MMO [50.58083807719749]
  We present the results of the second Neural MMO challenge, hosted at IJCAI 2022, which received 1600+ submissions. This competition targets robustness and generalization in multi-agent systems. We will open-source our benchmark including the environment wrapper, baselines, a visualization tool, and selected policies for further research.
  arXiv  Detail & Related papers  (2023-08-30T07:16:11Z)
• Competitions in AI -- Robustly Ranking Solvers Using Statistical Resampling [9.02080113915613]
  We show that rankings resulting from the standard interpretation of competition results can be very sensitive to even minor changes in the benchmark instance set used as the basis for assessment. We introduce a novel approach to statistically meaningful analysis of competition results based on resampling performance data. Our approach produces confidence intervals of competition scores as well as statistically robust solver rankings with bounded error.
  arXiv  Detail & Related papers  (2023-08-09T16:47:04Z)
• Rankings from multimodal pairwise comparisons [0.0]
  Given data on which competitors beat which others, the challenge is to rank the competitors from best to worst. Here we study the problem of computing rankings when there are multiple, potentially conflicting modes of comparison. We show that it is possible to compute a ranking in this situation and present a fast method for doing so, based on a combination of an expectation-maximization algorithm and a modified Bradley-Terry model.
  arXiv  Detail & Related papers  (2022-06-27T18:50:51Z)
• 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)
• 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)
• Incorporating Rivalry in Reinforcement Learning for a Competitive Game [65.2200847818153]
  This study focuses on providing a novel learning mechanism based on a rivalry social impact. Based on the concept of competitive rivalry, our analysis aims to investigate if we can change the assessment of these agents from a human perspective.
  arXiv  Detail & Related papers  (2020-11-02T21:54:18Z)
• Competing Bandits: The Perils of Exploration Under Competition [99.68537519404727]
  We study the interplay between exploration and competition on online platforms. We find that stark competition induces firms to commit to a "greedy" bandit algorithm that leads to low welfare. We investigate two channels for weakening the competition: relaxing the rationality of users and giving one firm a first-mover advantage.
  arXiv  Detail & Related papers  (2020-07-20T14:19:08Z)
• 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)
• Contributions of Talent, Perspective, Context and Luck to Success [0.0]
  We propose a controlled simulation within a competitive sum-zero environment as a proxy for disaggregating components of success. We simulate 100,000 runs of an agent-based model and analyze the results.
  arXiv  Detail & Related papers  (2019-12-31T19:00:33Z)

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.