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

Trend · papers per month

3877115153 · Jun 202019922001200920172026
48 results for player ability

We introduce an irreversible discrete multiplicative process that undergoes Bose-Einstein condensation as a generic model of competition. New players with different abilities successively join the game and compete for limited resources. A player's future gain is proportional to its ability and its current gain. The the…

2003-03-16abs ↗pdf ↗

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 ↗

We develop a model to study the role of rationality in economics and biology. The model's agents differ continuously in their ability to make rational choices. The agents' objective is to ensure their individual survival over time or, equivalently, to maximize profits. In equilibrium, however, rational agents who maxim…

2015-07-14abs ↗pdf ↗

Recent work in reinforcement learning demonstrated that learning solely through self-play is not only possible, but could also result in novel strategies that humans never would have thought of. However, optimization methods cast as a game between two players require careful tuning to prevent suboptimal results. Hence,…

2019-05-17abs ↗pdf ↗

A game-theoretic approach simplifies MBRL design and improves sample efficiency.

problem Designing stable and efficient MBRL algorithms using rich function approximators.
method Develops a game-theoretic framework where MBRL is modeled as a Stackelberg game between policy and model players.
result Proposed algorithms are highly sample efficient and match asymptotic performance of model-free policy gradient.

New game design method for better trait inference.

problem Inferring latent psychological traits from human behavior.
method Formulated as a mutual information maximization problem, solved using variational lower bound optimization.
result Designed games successfully distinguish among players with different traits, outperforming traditional methods.

In many professons employees are rewarded according to their relative performance. Corresponding economy can be modeled by taking NN independent agents who gain from the market with a rate which depends on their current gain. We argue that this simple realistic rate generates a scale free distribution even though intr…

2007-04-17abs ↗pdf ↗

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 ↗

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.

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 for multi-player bandits with selfish players, achieving logarithmic regret.

problem Challenges of robustness to selfish players in multi-player bandits.
method First algorithm robust to selfish players achieving logarithmic regret, with or without collision observation.
result Achieved logarithmic regret for robust algorithms to selfish players in multi-player bandits.

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.

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).

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 ↗

Understanding and reasoning about physics is an important ability of intelligent agents. We develop the PHYRE benchmark for physical reasoning that contains a set of simple classical mechanics puzzles in a 2D physical environment. The benchmark is designed to encourage the development of learning algorithms that are sa…

2019-08-15abs ↗pdf ↗

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.

Technology has had an unquestionable impact on the way people watch sports. Along with this technological evolution has come a higher standard to ensure a good viewing experience for the casual sports fan. It can be argued that the pervasion of statistical analysis in sports serves to satiate the fan's desire for detai…

2011-02-27abs ↗pdf ↗

We study analytically and numerically Minority Games in which agents may invest in different assets (or markets), considering both the canonical and the grand-canonical versions. We find that the likelihood of agents trading in a given asset depends on the relative amount of information available in that market. More s…

2006-03-19abs ↗pdf ↗

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 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 ↗

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.

Researchers predict NBA player salaries using machine learning, avoiding overfitting.

problem Predicting NBA player salaries based on performance statistics.
method Selected important determinants, used Random Forest machine learning, avoided overfitting.
result Very satisfactory salary predictions identified for important factors.

Paper explains adversarial training's robust overfitting through a minimax game perspective.

problem Adversarial training suffers from robust overfitting after learning rate decay.
method Viewing adversarial training as a dynamic minimax game, analyzing how LR decay breaks balance and leads to overfitting.
result ReBalanced Adversarial Training (ReBAT) alleviates robust overfitting without sacrificing robustness.

MpFL models clients as strategic players to reach equilibrium with less communication.

problem Real-world clients act independently with individual objectives, not aligned with a shared global model.
method MpFL uses game-theoretic modeling and PEARL-SGD algorithm for local updates and communication.
result PEARL-SGD reaches an equilibrium with less communication than non-local updates in stochastic setup.

Algorithm aggregates rewards from multiple players to learn related tasks in online bandit learning.

problem Learning related but slightly different tasks in an online setting with heterogeneous feedback.
method RobustAgg(ε)(ε) algorithm that aggregates rewards from different players.
result Achieves instance-dependent regret guarantees and nearly matching lower bounds.