Data-Driven Team Selection in Fantasy Premier League Using Integer Programming and Predictive Modeling Approach

• URL: http://arxiv.org/abs/2505.02170v1
• Date: Sun, 04 May 2025 16:21:59 GMT
• Title: Data-Driven Team Selection in Fantasy Premier League Using Integer Programming and Predictive Modeling Approach
• Authors: Danial Ramezani,
• Abstract summary: This paper proposes novel deterministic and robust integer programming models that select the optimal starting eleven and the captain.<n>A new hybrid scoring metric is constructed using an interpretable artificial intelligence framework and underlying match performance data.<n>Results indicate that the proposed hybrid method achieved the highest score while maintaining consistent performance.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Fantasy football is a billion-dollar industry with millions of participants. Constrained by a fixed budget, decision-makers draft a squad whose players are expected to perform well in the upcoming weeks to maximize total points. This paper proposes novel deterministic and robust integer programming models that select the optimal starting eleven and the captain. A new hybrid scoring metric is constructed using an interpretable artificial intelligence framework and underlying match performance data. Several objective functions and estimation techniques are introduced for the programming model. To the best of my knowledge, this is the first study to approach fantasy football through this lens. The models' performance is evaluated using data from the 2023/24 Premier League season. Results indicate that the proposed hybrid method achieved the highest score while maintaining consistent performance. Utilizing the Monte Carlo simulation, the strategic choice of averaging techniques for estimating cost vectors, and the proposed hybrid approach are shown to be effective during the out-of-sample period. This paper also provides a thorough analysis of the optimal formations and players selected by the models, offering valuable insights into effective fantasy football strategies.

Related papers

• Analyzing Skill Element in Online Fantasy Cricket [1.6093668627931699]
  We develop a statistical framework to assess the role of skill in determining success on online fantasy cricket platforms.<n>Strategy performance is evaluated based on points, ranks, and payoff under two contest structures Mega and 4x or Nothing.<n>To capture adaptive behavior, we introduce a dynamic tournament model in which agent populations evolve through a softmax reweighting mechanism.
  arXiv  Detail & Related papers  (2025-12-24T06:55:23Z)
• MMR1: Enhancing Multimodal Reasoning with Variance-Aware Sampling and Open Resources [113.33902847941941]
  Variance-Aware Sampling (VAS) is a data selection strategy guided by Variance Promotion Score (VPS)<n>We release large-scale, carefully curated resources containing 1.6M long CoT cold-start data and 15k RL QA pairs.<n> Experiments across mathematical reasoning benchmarks demonstrate the effectiveness of both the curated data and the proposed VAS.
  arXiv  Detail & Related papers  (2025-09-25T14:58:29Z)
• OpenFPL: An open-source forecasting method rivaling state-of-the-art Fantasy Premier League services [0.0]
  This paper presents OpenFPL, an open-source Fantasy Premier League forecasting method developed exclusively from public data.<n>OpenFPL achieves accuracy comparable to a leading commercial service when tested prospectively on data from the 2024-25 season.
  arXiv  Detail & Related papers  (2025-07-29T13:59:51Z)
• Not All Rollouts are Useful: Down-Sampling Rollouts in LLM Reinforcement Learning [55.15106182268834]
  Reinforcement learning with verifiable rewards (RLVR) has emerged as the leading approach for enhancing reasoning capabilities in large language models.<n>It faces a fundamental compute and memory asymmetry: rollout generation is embarrassingly parallel and memory-light, whereas policy updates are communication-heavy and memory-intensive.<n>We introduce PODS (Policy Optimization with Down-Sampling), which decouples rollout generation from policy updates by training only on a strategically selected subset of rollouts.
  arXiv  Detail & Related papers  (2025-04-18T17:49:55Z)
• Cream of the Crop: Harvesting Rich, Scalable and Transferable Multi-Modal Data for Instruction Fine-Tuning [59.56171041796373]
  We harvest multi-modal instructional data in a robust and efficient manner.<n>We take interaction style as diversity indicator and use a multi-modal rich styler to identify data instruction patterns.<n>Across 10+ experimental settings, validated by 14 multi-modal benchmarks, we demonstrate consistent improvements over random sampling, baseline strategies and state-of-the-art selection methods.
  arXiv  Detail & Related papers  (2025-03-17T17:11:22Z)
• Multi-Step Alignment as Markov Games: An Optimistic Online Gradient Descent Approach with Convergence Guarantees [91.88803125231189]
  Reinforcement Learning from Human Feedback (RLHF) has been highly successful in aligning large language models with human preferences.<n>While prevalent methods like DPO have demonstrated strong performance, they frame interactions with the language model as a bandit problem.<n>In this paper, we address these challenges by modeling the alignment problem as a two-player constant-sum Markov game.
  arXiv  Detail & Related papers  (2025-02-18T09:33:48Z)
• How to Select Datapoints for Efficient Human Evaluation of NLG Models? [57.60407340254572]
  We develop a suite of selectors to get the most informative datapoints for human evaluation.<n>We show that selectors based on variance in automated metric scores, diversity in model outputs, or Item Response Theory outperform random selection.<n>In particular, we introduce source-based estimators, which predict item usefulness for human evaluation just based on the source texts.
  arXiv  Detail & Related papers  (2025-01-30T10:33:26Z)
• Optimizing Fantasy Sports Team Selection with Deep Reinforcement Learning [0.2399911126932527]
  We develop a model that can adaptively select players to maximize the team's potential performance.<n>Our approach leverages historical player data to train RL algorithms, which then predict future performance and optimize team composition.<n>Our results show that RL-based strategies provide valuable insights into player selection in fantasy sports.
  arXiv  Detail & Related papers  (2024-12-26T13:36:18Z)
• 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)
• Iterative Nash Policy Optimization: Aligning LLMs with General Preferences via No-Regret Learning [55.65738319966385]
  We propose a novel online algorithm, iterative Nash policy optimization (INPO)<n>Unlike previous methods, INPO bypasses the need for estimating the expected win rate for individual responses.<n>With an LLaMA-3-8B-based SFT model, INPO achieves a 42.6% length-controlled win rate on AlpacaEval 2.0 and a 37.8% win rate on Arena-Hard.
  arXiv  Detail & Related papers  (2024-06-30T08:00:34Z)
• Beyond Suspension: A Two-phase Methodology for Concluding Sports Leagues [0.0]
  Professional sports leagues may be suspended due to various reasons such as the recent COVID-19 pandemic. A critical question the league must address when re-opening is how to appropriately select a subset of the remaining games to conclude the season in a shortened time frame. We propose a data-driven model which exploits predictive and prescriptive analytics to produce a deterministic schedule for the remainder of the season comprised of a subset of originally-scheduled games.
  arXiv  Detail & Related papers  (2024-03-29T22:23:35Z)
• Method and Validation for Optimal Lineup Creation for Daily Fantasy Football Using Machine Learning and Linear Programming [0.0]
  Daily fantasy sports (DFS) are weekly or daily online contests where real-game performances of individual players are converted to fantasy points (FPTS) This paper focuses on (1) the development of a method to forecast NFL player performance under uncertainty and (2) determining an optimal lineup to maximize FPTS under a set salary cap.
  arXiv  Detail & Related papers  (2023-09-26T20:26:32Z)
• MILO: Model-Agnostic Subset Selection Framework for Efficient Model Training and Tuning [68.12870241637636]
  We propose MILO, a model-agnostic subset selection framework that decouples the subset selection from model training. Our empirical results indicate that MILO can train models $3times - 10 times$ faster and tune hyperparameters $20times - 75 times$ faster than full-dataset training or tuning without performance.
  arXiv  Detail & Related papers  (2023-01-30T20:59:30Z)
• Predicting Football Match Outcomes with eXplainable Machine Learning and the Kelly Index [0.0]
  A machine learning approach is developed for predicting the outcomes of football matches. The dataset originated from the Premier League match data covering the 2019-2021 seasons. The paper also devised an investment strategy in order to evaluate its effectiveness by benchmarking against bookmaker odds.
  arXiv  Detail & Related papers  (2022-11-28T19:32:58Z)
• Data Science Approach to predict the winning Fantasy Cricket Team Dream 11 Fantasy Sports [0.0]
  The application of Data Science and Analytics is Ubiquitous in the Modern World. We built a predictive model that predicts the performance of players in a prospective game.
  arXiv  Detail & Related papers  (2022-09-15T01:58:57Z)
• Meta-Wrapper: Differentiable Wrapping Operator for User Interest Selection in CTR Prediction [97.99938802797377]
  Click-through rate (CTR) prediction, whose goal is to predict the probability of the user to click on an item, has become increasingly significant in recommender systems. Recent deep learning models with the ability to automatically extract the user interest from his/her behaviors have achieved great success. We propose a novel approach under the framework of the wrapper method, which is named Meta-Wrapper.
  arXiv  Detail & Related papers  (2022-06-28T03:28:15Z)
• Prediction of Football Player Value using Bayesian Ensemble Approach [13.163358022899335]
  We present a case study on the key factors affecting the world's top soccer players' transfer fees based on the FIFA data analysis. To predict each player's market value, we propose an improved LightGBM model using a Tree-structured Parzen Estimator (TPE) algorithm.
  arXiv  Detail & Related papers  (2022-06-24T07:13:53Z)
• Explainable expected goal models for performance analysis in football analytics [5.802346990263708]
  This paper proposes an accurate expected goal model trained consisting of 315,430 shots from seven seasons between 2014-15 and 2020-21 of the top-five European football leagues. To best of our knowledge, this is the first paper that demonstrates a practical application of an explainable artificial intelligence tool aggregated profiles.
  arXiv  Detail & Related papers  (2022-06-14T23:56:03Z)
• DORB: Dynamically Optimizing Multiple Rewards with Bandits [101.68525259222164]
  Policy-based reinforcement learning has proven to be a promising approach for optimizing non-differentiable evaluation metrics for language generation tasks. We use the Exp3 algorithm for bandits and formulate two approaches for bandit rewards: (1) Single Multi-reward Bandit (SM-Bandit); (2) Hierarchical Multi-reward Bandit (HM-Bandit) We empirically show the effectiveness of our approaches via various automatic metrics and human evaluation on two important NLG tasks.
  arXiv  Detail & Related papers  (2020-11-15T21:57:47Z)
• 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)

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.