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,657 papers · 148 categories

Trend · papers per month

7142128 · Jun 202019922001200920172026
48 results for 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).

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 ↗

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 ↗

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.

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 ↗

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.

New strategy achieves optimal regret without communication or collisions in multi-player bandit.

problem Cooperative multi-player stochastic multi-armed bandit with shared randomness.
method Combination of combinatorial approach to generalize geometric intuition.
result Achieves near-optimal regret ildeO(T) ilde{O}(\sqrt{T}) for any number of players and arms without collisions.

New algorithm for multi-player bandits in decentralized, asynchronous systems.

problem Challenges in decentralized, asynchronous multi-player bandits, including coordination and player detection.
method Adaptive exploration-exploitation algorithm that reduces collisions and detects player presence.
result Achieves regret of O(TlogT+logT/Δ2)\mathcal{O}(\sqrt{T \log T} + {\log T}/{Δ^2}).

The possibility of using player engagement predictions to profile high spending video game users is explored. In particular, individual-player survival curves in terms of days after first login, game level reached and accumulated playtime are used to classify players into different groups. Lifetime value predictions fo…

2019-07-09abs ↗pdf ↗

Market valuation duration is 175 years, but drops to 46 years during crises.

problem Understanding the duration of market valuation and its impact on returns.
method Comparing market valuation ratios and dividends to estimate duration, analyzing the discount rate effect.
result Valuation duration is negatively correlated with market returns, with a robust out-of-sample R2 of 15%.

Business cycles affect startup valuations, both directly and indirectly.

problem How do business cycles impact startup valuations?
method Structural Equation Model approach using a dataset of 1,089 venture capital investments.
result Business cycles impact startup valuations both directly and indirectly.

New learning dynamics adapt to corrupted games, improving performance in real-world scenarios.

problem Learning dynamics in games are limited to honest players, ignoring real-world corruption.
method Adaptive learning dynamics that adapt to player deviations from prescribed algorithms.
result Learning dynamics achieve better performance in corrupted games, matching honest regime bounds.

Paper presents content-based models for game recommendation in cold start scenarios.

problem Cold start problem in game recommendation where new games and players have no historical data.
method Uses survey data to develop content-based interaction models that generalize to new games, players, and both.
result Content models outperform collaborative filtering in predicting new interactions.

Classification of SL(n) covariant valuations on Orlicz spaces.

problem Classifying continuous SL(n) covariant valuations on Orlicz spaces.
method Complete classification without symmetric assumptions, focusing on moment matrix and a new functional in dimension two.
result The moment matrix is the only SL(n) covariant valuation for n≥3, and a new functional appears in dimension two.

Algorithm reduces regret in multi-player bandits with unknown collision rewards.

problem Reducing regret in multi-player multi-armed bandits with unknown collision rewards.
method Proposes an algorithm that combines a modified successive elimination strategy with a communication protocol to estimate suboptimality gaps and coordinate among players.
result Achieves logarithmic regret for the problem when collision reward is unknown.

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 ↗

We prove new kinematic formulas for tensor valuations and simplify previously known Crofton formulas by using the recently developed algebraic theory of translation invariant valuations. The heart of the paper is the computation of the Alesker-Fourier transform on the large class of spherical valuations, which is achie…

2014-02-12abs ↗pdf ↗

Classifies contravariant matrix-valued valuations on polytopes without continuity assumptions.

problem Classifying contravariant matrix-valued valuations on polytopes without continuity assumptions.
method Complete classification of contravariant matrix-valued valuations on polytopes in Rn\mathbb{R}^n without continuity assumptions.
result The only such valuation is the general Lutwak-Yang-Zhang matrix in dimension n4n \geq 4, and a new function in dimension 3.

Let SO+(p,q)\mathrm{SO}^+(p,q) denote the identity connected component of the real orthogonal group with signature (p,q)(p,q). We give a complete description of the spaces of continuous and generalized translation- and SO+(p,q)\mathrm{SO}^+(p,q)-invariant valuations, generalizing Hadwiger's classification of Euclidean isometry-invari…

2016-02-28abs ↗pdf ↗

We consider a setting where multiple players sequentially choose among a common set of actions (arms). Motivated by a cognitive radio networks application, we assume that players incur a loss upon colliding, and that communication between players is not possible. Existing approaches assume that the system is stationary…

2019-02-21abs ↗pdf ↗