Paper proposes player roles from match data to help clubs.
problem Difficulty in determining a player's fit for a team's style.
method Identifies 21 player roles from match event data.
result Automatic identification of player roles from match data.
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.
169,051 papers · 148 categories
Trend · papers per month
48 results for “player roles”
We study the frictions in the patterns of trades in the Euro money market. We characterize the structure of lending relations during the period of recent financial turmoil. We use network-topology method on data from overnight transactions in the Electronic Market for Interbank Deposits (e-Mid) to investigate on two ma…
DeepRole learns to play hidden role games like Avalon.
problem Learning cooperation in uncertain multi-agent settings.
method Combines CFR and deep learning with deductive reasoning.
result DeepRole outperforms other agents and humans in Avalon.
Paper presents Transfer Portal model for accurate player performance predictions.
problem Predicting future player performance after a transfer.
method Personalized neural network and Bayesian updating framework.
result Model generates accurate predictions for player performance at new clubs.
Market ecology of active and passive investorscond-mat.dis-nn
We study the role of active and passive investors in an investment market with uncertainties. Active investors concentrate on a single or a few stocks with a given probability of determining the quality of them. Passive investors spread their investment uniformly, resembling buying the market index. In this toy market …
Darwinian Adverse Selectionphysics.soc-ph
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…
A new algorithm reduces regret in multi-player bandits without collision info.
problem Decentralized multi-player multi-armed bandits with no collision info.
method EC-SIC algorithm using optimal error correction coding for reward statistics.
result Regret approaches that of centralized with collision info.
Bardo Composer generates tabletop RPG music based on player speech.
problem Creating immersive background music for tabletop RPGs.
method Speech recognition, emotion classification, and music generation using a novel beam search algorithm.
result Generated music pieces can be accurately identified by human subjects as conveying the intended emotion.
Gradient descent-ascent converges to strict local minmax equilibria with a finite timescale separation.
problem Analyzing the convergence of gradient descent-ascent in non-convex, non-concave games with a finite timescale separation.
method Investigates the role of a finite timescale separation parameter τ on gradient descent-ascent in two-player zero-sum games, providing convergence rates and non-convergence results.
result Gradient descent-ascent converges to strict local minmax equilibria for a finite timescale separation parameter τ*.
We consider models of financial markets in which all parties involved find incentives to participate. Strategies are evaluated directly by their virtual wealths. By tuning the price sensitivity and market impact, a phase diagram with several attractor behaviors resembling those of real markets emerge, reflecting the ro…
We introduce CSE for MLSF games and devise online learning algorithms for achieving no-external Stackelberg-regret.
problem Learning equilibrium in leader-follower games with noisy bandit feedback.
method Proposed Correlated Stackelberg Equilibrium (CSE) and online learning algorithms balancing exploration and exploitation.
result Achieves no-external Stackelberg-regret, converging to approximate CSE.
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.
Bayesian rating system for large competitions improves prediction and efficiency.
problem Rating systems for large, competitive events like online programming contests.
method Developed a Bayesian rating system for many participants, proving robustness and runtime.
result The system outperforms existing systems in accuracy and computation speed.
Paper optimizes multi-agent learning in Markov games with generative model.
problem Learning Nash or CCE equilibria in multi-agent Markov games.
method Develops \myalg~algorithm and adaptive sampling scheme using FTRL method.
result Minimax-optimal learning of CCE with minimal samples.
Algorithm converges to Nash equilibria in competitive games.
problem Finding Nash equilibria in decentralized, competitive Markov games.
method Decentralized Optimistic Gradient Descent/Ascent with a critic.
result Converges to the set of Nash equilibria under self-play.
New trekking approach reduces collisions in multi-player bandits.
problem Stochastic multi-armed bandits with many unknown players.
method Trekking approach to minimize collisions and regret.
result Guaranteed constant and sub-linear regret for static and dynamic scenarios.
Online learning has traditionally focused on the expected rewards. In this paper, a risk-averse online learning problem under the performance measure of the mean-variance of the rewards is studied. Both the bandit and full information settings are considered. The performance of several existing policies is analyzed, an…
We consider a symmetric multi-players zero-sum game with two strategic variables. There are players, . Each player is denoted by . Two strategic variables are and , . They are related by invertible functions. Using the minimax theorem by \cite{sion} we will show that Nas…
Decentralized Heterogeneous Multi-Player Multi-Armed Bandits with Non-Zero Rewards on Collisionscs.LG
A policy for near-optimal multi-player bandits with non-zero collision rewards.
problem Decentralized multi-player bandits with heterogeneous rewards and collisions.
method A policy achieving near-optimal regret in a non-communicative setting.
result Near order-optimal expected regret of for .
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 , where is the total time of adversarial attacks.
Predict player lifetime value based on engagement metrics.
problem User profiling in video games.
method Survival curves, deep learning, long short-term memory.
result Deep learning predicts player lifetime value.
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…
New algorithm reduces regret in multi-player bandits with collision information.
problem Optimizing decisions in multi-player bandits with collision penalties.
method Developed an algorithm with optimal regret under collision announcements, and sublinear regret without collision info.
result First -type regret guarantee for non-stochastic multi-player multi-armed bandits with collision information.
New algorithms for n-player games using a player-centered approach.
problem Learning near-perfect strategies in multiplayer games.
method Player-centered reinforcement learning with Final Adaptation RL.
result FARL is crucial for achieving near-perfect strategies in various games.
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.
We develop a machine learning approach to represent and analyze the underlying spatial structure that governs shot selection among professional basketball players in the NBA. Typically, NBA players are discussed and compared in an heuristic, imprecise manner that relies on unmeasured intuitions about player behavior. T…
Paper uses Apprenticeship Learning to model player behavior in interactive narratives.
problem Understanding and simulating player behavior in interactive narratives.
method Receding Horizon IRL (RHIRL) to learn reward functions and policies.
result RHIRL can learn action sequences and generate behavior similar to specific players.
New algorithm for multi-player bandits in changing environments.
problem Sequential action selection with collisions and adversarial losses.
method First provable Multi-player Bandit algorithm for changing environments.
result Resolves open problem in adversarial multi-player settings.
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.
A new algorithm RESYNC for defenders against malicious attackers in multi-player bandits.
problem Malicious players colliding with cooperative players to prevent rewards.
method Decentralized and robust algorithm RESYNC for defenders.
result RESYNC algorithm is order-optimal, performing gracefully as the number of collisions increases.
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 and regret.
Could short selling make financial markets tumble?cond-mat.stat-mech
It is suggested to consider long term trends of financial markets as a growth phenomenon. The question that is asked is what conditions are needed for a long term sustainable growth or contraction in a financial market? The paper discuss the role of traditional market players of long only mutual funds versus hedge fund…
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 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 .
Method predicts NBA players' multi-modal movement trajectories.
problem Understanding NBA players' decision-making during games.
method LSTM-based architecture with multi-modal loss function.
result Method outperforms state-of-the-art in predicting realistic trajectories.
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.
Content Based Player and Game Interaction Model for Game Recommendation in the Cold Start settingcs.IR
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.
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 …
Proposes a novel path generation and evaluation method for video games.
problem Generating and evaluating realistic navigation paths for video games.
method Combines nonparametric model-free transformations and copula models.
result Demonstrates precise and interpretable generation of diverse navigation paths.
New framework values football players based on in-game interactions.
problem Valuing football players based on in-game performance.
method Combining financial models and network theory using a passing matrix.
result Dynamic and individualized player valuation framework.
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.
A variety of machine learning models have been proposed to assess the performance of players in professional sports. However, they have only a limited ability to model how player performance depends on the game context. This paper proposes a new approach to capturing game context: we apply Deep Reinforcement Learning (…
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.
The in-game economies of massively multi-player online games (MMOGs) are complex systems that have to be carefully designed and managed. This paper presents the results of an analysis of auction house data from the MMOG Glitch, across a 14 month time period, the entire lifetime of the game. The data comprise almost 3 m…