Related papers: Martingale Approach to Gambler's Ruin Problem for …
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…
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…
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 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…
In this paper, we propose a new multi-armed bandit problem called the Gambler's Ruin Bandit Problem (GRBP). In the GRBP, the learner proceeds in a sequence of rounds, where each round is a Markov Decision Process (MDP) with two actions…
We consider the simple random walk on the $N$-dimensional integer lattice from the perspective of evaluating asymptotically the duration of play in the multidimensional gambler\apost s ruin problem. We show that, under suitable rescalings,…
This paper treats of a kind of a gambler's ruin problem, which seeks the probability that a random walker first hits the origin at a certain time. In addition to a usual random walk which hops either rightwards or leftwards, the present…
We obtain absorption probabilities and expected time until absorption for different stopping strategies in gambler's ruin problem using the concept of multiple function barriers
The usual development of the continuous-time random walk (CTRW) proceeds by assuming that the present is one of the jumping times. Under this restrictive assumption integral equations for the propagator and mean escape times have been…
We used the random walk to model the problem of reserves. The classic case of a stochastic process is the example of random walks, which are used to study a set of phenomena and, particularly, as in this article, models of reserves…
The effect of space inhomogeneities on a diffusing particle is studied in the framework of the 1D random walk. The typical time needed by a particle to cross a one--dimensional finite lane, the so--called residence time, is computed…
We consider a model of open quantum random walk and together with a quantum trajectory approach we are able to examine a notion of hitting time. We see that many constructions, such as minimal solutions to hitting time problems, are…
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 laws of chance are often subtle and deceptive. This is why games of chance work. People are convinced that they obey seemingly intuitive laws, while the underlying mathematical structure reveals a different and more complex reality.…
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…
We develop an approach to solve Barberis (2012)'s casino gambling model in which a gambler whose preferences are specified by the cumulative prospect theory (CPT) must decide when to stop gambling by a prescribed deadline. We assume that…
Subordinating a random walk to a renewal process yields a continuous time random walk (CTRW) model for diffusion, including the possibility of anomalous diffusion. Transition densities of scaling limits of power law CTRWs have been shown to…
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 this paper we consider the Parisian ruin probabilities for the dual risk model in a discrete-time setting. By exploiting the strong Markov property of the risk process we derive a recursive expression for the fnite-time Parisian ruin…