arXiv research

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

Paper uses Apprenticeship Learning to model player behavior in interactive narratives.

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…

We consider the non-stochastic version of the (cooperative) multi-player multi-armed bandit problem. The model assumes no communication at all between the players, and furthermore when two (or more) players select the same action this results in a maximal loss. We prove the first $\sqrt{T}$-type regret guarantee for th…

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

Paper presents Transfer Portal model for accurate player performance predictions.

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

New framework values football players based on in-game interactions.

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

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 (…

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…

All people have to make risky decisions in everyday life. And we do not know how true they are. But is it possible to mathematically assess the correctness of our choice? This article discusses the model of decision making under risk on the example of project management. This is a game with two players, one of which is…

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

A policy for near-optimal multi-player bandits with non-zero collision rewards.

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

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

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…

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 algorithms for n-player games using a player-centered approach.

New algorithm for multi-player bandits with selfish players, achieving logarithmic regret.

SciSports is a Dutch startup company specializing in football analytics. This paper describes a joint research effort with SciSports, during the Study Group Mathematics with Industry 2018 at Eindhoven, the Netherlands. The main challenge that we addressed was to automatically process empirical football players' traject…

The dynamics of market prices is described as the evolution of opinions in the trading community regarding future market behavior. The price then is a function of the voting process of the market players in favor to raise or reduce the value of a stock. The model presented in this paper is suited for pricing of options…

A new algorithm RESYNC for defenders against malicious attackers in multi-player bandits.

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

New algorithms tackle adversarial multi-player bandits with forced-collision communication.

We study multiplayer stochastic multi-armed bandit problems in which the players cannot communicate and if two or more players pull the same arm, a collision occurs and the involved players receive zero reward. We consider two feedback models: a model in which the players can observe whether a collision has occurred an…

Graphon game model simplifies stochastic interactions among agents.

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

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

Study on market entry timing in stock liquidation with trading constraints.

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…

This work models GHG offset credit markets to find optimal strategies for market participants.

Predicting and improving player retention is crucial to the success of mobile Free-to-Play games. This paper explores the problem of rapid retention prediction in this context. Heuristic modeling approaches are introduced as a way of building simple rules for predicting short-term retention. Compared to common classifi…

We study the multi-player stochastic multiarmed bandit (MAB) problem in an abruptly changing environment. We consider a collision model in which a player receives reward at an arm if it is the only player to select the arm. We design two novel algorithms, namely, Round-Robin Sliding-Window Upper Confidence Bound\# (RR-…

Research tackles alliance formation in many-player zero-sum games, showing reinforcement learning fails but a contract mechanism can help.

Study on information cascade fragility under mismatched revealing probabilities.

We propose a novel ranking model that combines the Bradley-Terry-Luce probability model with a nonnegative matrix factorization framework to model and uncover the presence of latent variables that influence the performance of top tennis players. We derive an efficient, provably convergent, and numerically stable majori…

We consider the problem of learning in single-player and multiplayer multiarmed bandit models. Bandit problems are classes of online learning problems that capture exploration versus exploitation tradeoffs. In a multiarmed bandit model, players can pick among many arms, and each play of an arm generates an i.i.d. rewar…

Researchers create a framework to value player actions in CSGO.

Method predicts NBA players' multi-modal movement trajectories.

Study optimal portfolios for many players in a market model with random coefficients.

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

In recent years, constrained optimization has become increasingly relevant to the machine learning community, with applications including Neyman-Pearson classification, robust optimization, and fair machine learning. A natural approach to constrained optimization is to optimize the Lagrangian, but this is not guarantee…

We study a multiplayer stochastic multi-armed bandit problem in which players cannot communicate, and if two or more players pull the same arm, a collision occurs and the involved players receive zero reward. We consider the challenging heterogeneous setting, in which different arms may have different means for differe…

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

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 …

Reducing user attrition, i.e. churn, is a broad challenge faced by several industries. In mobile social games, decreasing churn is decisive to increase player retention and rise revenues. Churn prediction models allow to understand player loyalty and to anticipate when they will stop playing a game. Thanks to these pre…

No communication allows optimal instance-dependent regret guarantees in multi-player bandits.