Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

7152229 · Jun 202019922001200920172026
48 results for soccer player valuation

Study predicts soccer player market values using machine learning and SHAP for interpretability.

problem Predicting accurate market values for professional soccer players.
method Ensemble machine learning models, SHAP for interpretability, Boruta for feature selection.
result GBDT model achieved high predictive accuracy (R-squared 0.901, RMSE 3,221,632.175).

Assessing the impact of the individual actions performed by soccer players during games is a crucial aspect of the player recruitment process. Unfortunately, most traditional metrics fall short in addressing this task as they either focus on rare actions like shots and goals alone or fail to account for the context in …

2018-02-18abs ↗pdf ↗

Framework analyzes physical metrics in soccer to link performance with value.

problem Understanding and quantifying the value of physical performance in soccer.
method Estimating physical indicators from tracking data, contextualizing runs, linking with possession-value model.
result Physical performance correlates with value generation in soccer.

Quantitative analysis of soccer players' passing ability focuses on descriptive statistics without considering the players' real contribution to the passing and ball possession strategy of their team. Which player is able to help the build-up of an attack, or to maintain the possession of the ball? We introduce a novel…

2016-08-08abs ↗pdf ↗

This paper introduces glocal explanations for expected goal models in soccer.

problem Limited interpretability of expected goal models trained with black-box methods.
method Proposes glocal explanations using aggregated SHAP values and partial dependence profiles.
result Extracts knowledge from expected goal models for teams and players, enhancing performance analysis.

Technology offers new ways to measure the locations of the players and of the ball in sports. This translates to the trajectories the ball takes on the field as a result of the tactics the team applies. The challenge professionals in soccer are facing is to take the reverse path: given the trajectories of the ball is i…

2015-08-10abs ↗pdf ↗

SoccerCPD detects tactical changes in soccer matches using spatiotemporal tracking data.

problem Detecting consistent team formations in fluid sports like soccer.
method Two-step change-point detection: formation and role changes.
result Accurately detects tactical changes and estimates formation and role assignments.

Study uses complex networks and machine learning to predict soccer match outcomes.

problem Predicting soccer match outcomes with complex networks and machine learning.
method Complex network metrics and match statistics were used to build machine learning models.
result Models based on passing networks were as effective as traditional models using match statistics.

In this paper, we introduce the Fairness GAN, an approach for generating a dataset that is plausibly similar to a given multimedia dataset, but is more fair with respect to protected attributes in allocative decision making. We propose a novel auxiliary classifier GAN that strives for demographic parity or equality of …

2018-05-24abs ↗pdf ↗

In this work we present STEVE - Soccer TEam VEctors, a principled approach for learning real valued vectors for soccer teams where similar teams are close to each other in the resulting vector space. STEVE only relies on freely available information about the matches teams played in the past. These vectors can serve as…

2019-07-30abs ↗pdf ↗

RL controls small soccer robots in a real league, beating human-designed policies.

problem Training robots to play complex, real-world sports.
method Sim-to-Real RL approach, training in simulated environment, applying to real-world robots.
result Robots learned policies to compete effectively, beating human-designed strategies.

A game-theoretic approach selects features by testing their marginal contributions.

problem Feature selection in econometric and statistical models.
method A coalitional game where features are players and payoff is model performance. Hypothesis test decides feature relevance.
result The approach significantly outperforms existing methods in simulations.

The paper analyzes a game where players must balance short-term and long-term interests, leading to cooperative or competitive outcomes.

problem Analyzing time inconsistency in inter-personal decision-making under non-exponential discounting.
method Iterative procedures and Zorn's lemma to find Nash equilibria between players' intra-personal equilibria.
result Inter-personal equilibria exist and depend on the impatience levels of the players.

Professional baseball players are increasingly guaranteed expensive long-term contracts, with over 70 deals signed in excess of \$90 million, mostly in the last decade. These are substantial sums compared to a typical franchise valuation of \$1-2 billion. Hence, the players to whom a team chooses to give such a contrac…

2017-12-15abs ↗pdf ↗

Predicts next actions in soccer possessions using path signatures.

problem Predicting next actions in soccer possessions with high accuracy.
method Leveraging path signatures to encode spatio-temporal structure of recent possessions, avoiding manual feature engineering.
result Our approach outperforms transformer-based benchmarks across various loss metrics and reduces computational cost.

In-game win probability models, which provide a sports team's likelihood of winning at each point in a game based on historical observations, are becoming increasingly popular. In baseball, basketball and American football, they have become important tools to enhance fan experience, to evaluate in-game decision-making,…

2019-06-12abs ↗pdf ↗

We propose a reinforcement learning solution to the \emph{soccer dribbling task}, a scenario in which a soccer agent has to go from the beginning to the end of a region keeping possession of the ball, as an adversary attempts to gain possession. While the adversary uses a stationary policy, the dribbler learns the best…

2013-05-28abs ↗pdf ↗

The availability of massive data about sports activities offers nowadays the opportunity to quantify the relation between performance and success. In this study, we analyze more than 6,000 games and 10 million events in six European leagues and investigate this relation in soccer competitions. We discover that a team's…

2017-05-02abs ↗pdf ↗

In illiquid markets, option traders may have an incentive to increase their portfolio value by using their impact on the dynamics of the underlying. We provide a mathematical framework within which to value derivatives under market impact in a multi-player framework by introducing strategic interactions into the Almgre…

2008-12-31abs ↗pdf ↗

Option contracts are a type of financial derivative that allow investors to hedge risk and speculate on the variation of an asset's future market price. In short, an option has a particular payout that is based on the market price for an asset on a given date in the future. In 1973, Black and Scholes proposed a valuati…

2012-02-12abs ↗pdf ↗

We propose an original model for inferring team strengths using a Markov Random Field, which can be used to generate historical estimates of the offensive and defensive strengths of a team over time. This model was designed to be applied to sports such as soccer or hockey, in which contest outcomes take value in a limi…

2013-05-09abs ↗pdf ↗

We compare various extensions of the Bradley-Terry model and a hierarchical Poisson log-linear model in terms of their performance in predicting the outcome of soccer matches (win, draw, or loss). The parameters of the Bradley-Terry extensions are estimated by maximizing the log-likelihood, or an appropriately penalize…

2018-07-04abs ↗pdf ↗

This paper optimizes cybersecurity resource allocation in networks with heterogeneous attacker and defender valuations.

problem Optimizing cybersecurity resource allocation in networks with heterogeneous attacker and defender valuations.
method Combining strategic behavior of players with contagion dynamics, a method is extended to determine optimal resource allocation based on simple network metrics weighted by risk profiles.
result The asymmetry between attacker and defender valuations drives optimal attack and defense strategies, shaping system resilience.

New algorithm improves self-play reinforcement learning for competitive games.

problem Inefficient opponent selection in self-play reinforcement learning.
method Intelligently selects opponents based on adversarial rules derived from saddle point optimization.
result Algorithm converges to approximate equilibrium with high probability in convex-concave games.

Bayesian approach improves Shapley value estimation efficiency.

problem Efficiently estimating Shapley values in machine learning models.
method Bayesian experimental design using Gaussian process surrogate and adaptive coalition selection.
result Consistently improves sample efficiency in low-budget settings.

We study stochastic multi-armed bandits with many players. The players do not know the number of players, cannot communicate with each other and if multiple players select a common arm they collide and none of them receive any reward. We consider the static scenario, where the number of players remains fixed, and the d…

2018-09-17abs ↗pdf ↗

Paper introduces new actuarial-consistent valuations for insurance liabilities.

problem Valuation of insurance liabilities considering both financial and actuarial risks.
method Proposes two-step actuarial valuations and actuarial-consistent procedures.
result Actuarial-consistent valuations are equivalent to two-step actuarial valuations under coherence.

We consider a symmetric multi-players zero-sum game with two strategic variables. There are nn players, n3n\geq 3. Each player is denoted by ii. Two strategic variables are tit_i and sis_i, i{1,,n}i\in \{1, \dots, n\}. They are related by invertible functions. Using the minimax theorem by \cite{sion} we will show that Nas…

2018-06-17abs ↗pdf ↗

A multi-player bandit system resists adversarial attacks with near-optimal regret.

problem Adversaries attempt to manipulate rewards in a multi-player multi-armed bandit game.
method Players communicate a single bit to resist attacks, achieving near-optimal regret.
result Achieves near-optimal regret of O(log1+δT+W)O(\log^{1+δ}T + W), where WW is the total time of adversarial attacks.

Game contingent claims (GCCs) generalize American contingent claims by allowing the writer to recall the option as long as it is not exercised, at the price of paying some penalty. In incomplete markets, an appealing approach is to analyze GCCs like their European and American counterparts by solving option holder's an…

2017-07-28abs ↗pdf ↗

Twitter has been proven to be a notable source for predictive modelling on various domains such as the stock market, the dissemination of diseases or sports outcomes. However, such a study has not been conducted in football (soccer) so far. The purpose of this research was to study whether data mined from Twitter can b…

2014-11-05abs ↗pdf ↗

We consider two-player non-zero-sum stopping games in discrete time. Unlike Dynkin games, in our games the payoff of each player is revealed after both players stop. Moreover, each player can adjust her own stopping strategy according to the other player's action. In the first part of the paper, we consider the game wh…

2015-08-25abs ↗pdf ↗

New algorithm tackles multi-player bandit problems with limited access to arms.

problem Limited access to dynamic local subsets of arms in multi-player multi-armed bandit problems.
method Adopted Upper Confidence Bound (UCB) for exploration-exploitation and distributed optimization for collisions.
result Proposes a decentralized algorithm with near-optimal regret guarantee.

Algorithm optimizes multi-player learning with noisy rewards without direct communication.

problem Cooperative multi-player learning with noisy rewards and no communication.
method Upper and lower confidence bounds algorithm for optimal action selection.
result Achieves logarithmic O(logTΔa)O(\frac{\log T}{Δ_{\bm{a}}}) and O(TlogT)O(\sqrt{T\log T}) regret.