à paraîtreInternational audienceIn this paper we consider a particular class of problems called multiarmed gambler bandits (MAGB) which constitutes a modified version of the Bernoulli MAB problem where two new elements must be taken into account: the budget and the risk of ruin. The agent has an initial budget that evolves in time following the received rewards, which can be either +1 after a success or −1 after a failure. The problem can also be seen as a MAB version of the classic gambler's ruin game. The contribution of this paper is a preliminary analysis on the probability of being ruined given the current budget and observations, and the proposition of an alternative regret formulation, combining the classic regret notion with the exp...
The multi-armed bandit (MAB) problem refers to the task of sequentially assigning treatments to expe...
Empirical game-theoretic analysis refers to a set of models and techniques for solving large-scale g...
Multi-armed bandit problems are the most basic examples of sequential decision problems with an expl...
In a multi-armed bandit (MAB) problem a gambler needs to choose at each round of play one of K arms,...
International audienceWe formalize a particular class of problems called survival multiarmed bandits...
In this paper, we propose a new multi-armed bandit problem called the Gambler's Ruin Bandit Problem ...
This note explores the mathematical theory to solve modern gambler’s ruin problems. We establish a ...
The gambler starts with an i unit stake and the casino or house starts with c units. They repeatedly...
AbstractLet prize X in a game be a random variable with a cumulative distribution function F, E[X] ≠...
We study the survival bandit problem, a variant of the multi-armed bandit problem introduced in an o...
International audienceIn the standard definition of the classical gambler's ruin game, a persistent ...
The expected ruin time and the probabilities of ruin are found for the n-player gambler's ruin probl...
We study a two-player stochastic multi-armed bandit (MAB) problem with different expected rewards fo...
AbstractFormulas for the expected ruin time and the individual ruin probabilities are found for the ...
We extend the notion of regret with a welfarist perspective. Focussing on the classic multi-armed ba...
The multi-armed bandit (MAB) problem refers to the task of sequentially assigning treatments to expe...
Empirical game-theoretic analysis refers to a set of models and techniques for solving large-scale g...
Multi-armed bandit problems are the most basic examples of sequential decision problems with an expl...
In a multi-armed bandit (MAB) problem a gambler needs to choose at each round of play one of K arms,...
International audienceWe formalize a particular class of problems called survival multiarmed bandits...
In this paper, we propose a new multi-armed bandit problem called the Gambler's Ruin Bandit Problem ...
This note explores the mathematical theory to solve modern gambler’s ruin problems. We establish a ...
The gambler starts with an i unit stake and the casino or house starts with c units. They repeatedly...
AbstractLet prize X in a game be a random variable with a cumulative distribution function F, E[X] ≠...
We study the survival bandit problem, a variant of the multi-armed bandit problem introduced in an o...
International audienceIn the standard definition of the classical gambler's ruin game, a persistent ...
The expected ruin time and the probabilities of ruin are found for the n-player gambler's ruin probl...
We study a two-player stochastic multi-armed bandit (MAB) problem with different expected rewards fo...
AbstractFormulas for the expected ruin time and the individual ruin probabilities are found for the ...
We extend the notion of regret with a welfarist perspective. Focussing on the classic multi-armed ba...
The multi-armed bandit (MAB) problem refers to the task of sequentially assigning treatments to expe...
Empirical game-theoretic analysis refers to a set of models and techniques for solving large-scale g...
Multi-armed bandit problems are the most basic examples of sequential decision problems with an expl...