Related papers: Gambler's ruin probability - a general formula
We give explicit formulas for ruin probabilities in a multidimensional Generalized Gambler's ruin problem. The generalization is best interpreted as a game of one player against $d$ other players, allowing arbitrary winning and losing…
This note explores the mathematical theory to solve modern gamblers ruin problems. We establish a ruin framework and solve for the probability of bankruptcy. We also show how this relates to the expected time to bankruptcy and review the…
We present here a new extended model of the gambler's ruin problem by incorporating delays in receiving of rewards and paying of penalties. When there is a difference between two delays, an exact analysis of the ruin probability is…
A gambler with an initial fortune $x$ starts by betting a dollar, then doubles the bet after every win and halves the bet after every loss. Let $p\in (0,1)$ be the probability of winning for each round. We show that the gambler survives…
Consider gambler's ruin with three players, 1, 2, and 3, having initial capitals $A$, $B$, and $C$ units. At each round a pair of players is chosen (uniformly at random) and a fair coin flip is made resulting in the transfer of one unit…
Using experimental mathematics and symbolic computation, we derive many moments for the duration of a three player (fair) gambler's ruin.
The power of symbolic computation, as opposed to mere numerical computation, is illustrated with efficient algorithms for studying the generalized gambler's ruin problem in one and two dimensions. We also consider a new generalization of…
In the extended gambler's ruin problem we can move one step forward or backward (classical gambler's ruin problem), we can stay where we are for a time unit (delayed action) or there can be absorption in the current state (game is…
Chances of a gambler are always lower than chances of a casino in the case of an ideal, mathematically perfect roulette, if the capital of the gambler is limited and the minimum and maximum allowed bets are limited by the casino. However, a…
Can a probabilistic gambler get arbitrarily rich when all deterministic gamblers fail? We study this problem in the context of algorithmic randomness, introducing a new notion -- almost everywhere computable randomness. A binary sequence…
This work explains how to utilize earlier results by P. Diaconis, K. Houston-Edwards and the second author to estimate probabilities related to the 4-player gambler ruin problem. For instance, we show that the probability that a very…
Assume that letters (from a finite alphabet) in a text form a Markov chain. We track two distinct words, $U$ and $D$. A gambler gains 1 point for each occurrence of $U$ (including overlapping occurrences) and loses 1 point for each…
The gambler's ruin problem for correlated random walks (CRW), both with and without delays, is addressed using the Optional Stopping Theorem for martingales. We derive closed-form expressions for the ruin probabilities and the expected game…
This article studies in detail the solution of an integral equation due to Rongming et al. [13]. The methods involve complex analysis. As an application, we find the ruin probability of a given Bonus-Malus system in a steady state. We…
We apply the theory of linear recurrence sequences to find an expression for the ultimate ruin probability in a discrete-time risk process. We assume the claims follow an arbitrary distribution with support $\{0,1,\ldots,m\}$, for some…
Gambler's ruin estimates can be viewed as harmonic measure estimates for finite Markov chains which are absorbed (or killed) at boundary points. We relate such estimates to properties of the underlying chain and its Doob transform.…
We introduce a "high probability" framework for repeated games with incomplete information. In our non-equilibrium setting, players aim to guarantee a certain payoff with high probability, rather than in expected value. We provide a high…
In this paper we provide formulas for the expectation of a conditional game duration in a finite state-space one-dimensional gambler's ruin problem with arbitrary winning $p(n)$ and losing $q(n)$ probabilities (i.e., they depend on the…
We revisit the game in which each of several players chooses a pattern and then a coin is flipped repeatedly until one of these patterns is generated. In particular, we demonstrate how to compute the probability of any one player winning…
We give elementary examples within a framework for studying decisions under uncertainty where probabilities are only roughly known. The framework, in gambling terms, is that the size of a bet is proportional to the gambler's perceived…