CRICTRS: Embeddings based Statistical and Semi Supervised Cricket Team Recommendation System

• URL: http://arxiv.org/abs/2010.15607v1
• Date: Mon, 26 Oct 2020 15:35:44 GMT
• Title: CRICTRS: Embeddings based Statistical and Semi Supervised Cricket Team Recommendation System
• Authors: Prazwal Chhabra, Rizwan Ali, Vikram Pudi
• Abstract summary: We propose a semi-supervised statistical approach to build a team recommendation system for cricket. We design a qualitative and quantitative rating system which considers the strength of opposition also for evaluating player performance. We also embark on a critical aspect of team composition, which includes the number of batsmen and bowlers in the team.
• Score: 6.628230604022489
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Team Recommendation has always been a challenging aspect in team sports. Such systems aim to recommend a player combination best suited against the opposition players, resulting in an optimal outcome. In this paper, we propose a semi-supervised statistical approach to build a team recommendation system for cricket by modelling players into embeddings. To build these embeddings, we design a qualitative and quantitative rating system which considers the strength of opposition also for evaluating player performance. The embeddings obtained, describes the strengths and weaknesses of the players based on past performances of the player. We also embark on a critical aspect of team composition, which includes the number of batsmen and bowlers in the team. The team composition changes over time, depending on different factors which are tough to predict, so we take this input from the user and use the player embeddings to decide the best possible team combination with the given team composition.

Related papers

• Transformer Guided Coevolution: Improved Team Formation in Multiagent Adversarial Games [1.2338485391170533]
  We propose an algorithm that uses a transformer-based deep neural network with Masked Language Model training to select the best team of players from a trained population. We test our algorithm in the multiagent adversarial game Marine Capture-The-Flag, and we find that BERTeam learns non-trivial team compositions that perform well against unseen opponents.
  arXiv  Detail & Related papers  (2024-10-17T17:06:41Z)
• Multi-agent Multi-armed Bandits with Stochastic Sharable Arm Capacities [69.34646544774161]
  We formulate a new variant of multi-player multi-armed bandit (MAB) model, which captures arrival of requests to each arm and the policy of allocating requests to players. The challenge is how to design a distributed learning algorithm such that players select arms according to the optimal arm pulling profile. We design an iterative distributed algorithm, which guarantees that players can arrive at a consensus on the optimal arm pulling profile in only M rounds.
  arXiv  Detail & Related papers  (2024-08-20T13:57:00Z)
• 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)
• 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)
• Transfer Portal: Accurately Forecasting the Impact of a Player Transfer in Soccer [0.0]
  Predicting future player performance when transferred between different leagues is a complex task. In this paper, we present a method which addresses these issues and enables us to make accurate predictions of future performance. Our Transfer Portal model utilizes a personalized neural network accounting for both stylistic and ability level input representations for players, teams, and leagues to simulate future player performance at any chosen club.
  arXiv  Detail & Related papers  (2022-01-27T14:15:09Z)
• Offsetting Unequal Competition through RL-assisted Incentive Schemes [18.57907480363166]
  This paper investigates the dynamics of competition among organizations with unequal expertise. We design Touch-Mark, a game based on well-known multi-agent-particle-environment.
  arXiv  Detail & Related papers  (2022-01-05T04:47:22Z)
• 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)
• Coach-Player Multi-Agent Reinforcement Learning for Dynamic Team Composition [88.26752130107259]
  In real-world multiagent systems, agents with different capabilities may join or leave without altering the team's overarching goals. We propose COPA, a coach-player framework to tackle this problem. We 1) adopt the attention mechanism for both the coach and the players; 2) propose a variational objective to regularize learning; and 3) design an adaptive communication method to let the coach decide when to communicate with the players.
  arXiv  Detail & Related papers  (2021-05-18T17:27:37Z)
• My Team Will Go On: Differentiating High and Low Viability Teams through Team Interaction [17.729317295204368]
  We train a viability classification model over a dataset of 669 10-minute text conversations of online teams. We find that a lasso regression model achieves an accuracy of.74--.92 AUC ROC under different thresholds of classifying viability scores.
  arXiv  Detail & Related papers  (2020-10-14T21:33:36Z)
• Faster Algorithms for Optimal Ex-Ante Coordinated Collusive Strategies in Extensive-Form Zero-Sum Games [123.76716667704625]
  We focus on the problem of finding an optimal strategy for a team of two players that faces an opponent in an imperfect-information zero-sum extensive-form game. In that setting, it is known that the best the team can do is sample a profile of potentially randomized strategies (one per player) from a joint (a.k.a. correlated) probability distribution at the beginning of the game. We provide an algorithm that computes such an optimal distribution by only using profiles where only one of the team members gets to randomize in each profile.
  arXiv  Detail & Related papers  (2020-09-21T17:51:57Z)
• Evaluating and Rewarding Teamwork Using Cooperative Game Abstractions [103.3630903577951]
  We use cooperative game theory to study teams of artificial RL agents as well as real world teams from professional sports. We introduce a parametric model called cooperative game abstractions (CGAs) for estimating CFs from data. We provide identification results and sample bounds complexity for CGA models as well as error bounds in the estimation of the Shapley Value using CGAs.
  arXiv  Detail & Related papers  (2020-06-16T22:03:36Z)

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.