English
Related papers

Related papers: Gambler's ruin probability - a general formula

200 papers

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…

Probability · Mathematics 2017-08-24 Zbigniew Palmowski , Lewis Ramsden , Apostolos D. Papaioannou

We deal with a generalization of the classical risk model when an insurance company gets additional funds whenever a claim arrives and consider some practical approaches to the estimation of the ruin probability. In particular, we get an…

Probability · Mathematics 2015-03-19 Yuliya Mishura , Olena Ragulina , Oleksandr Stroyev

We consider the classical one-dimensional random walk of a particle on the right-half real line. We assume that the particle is initially at position x=k, k > 0, and moves to the right with probability p or to the left with probability 1-p.…

Probability · Mathematics 2007-05-23 Oscar Bolina

We consider a generalization of the classical risk model when the premium intensity depends on the current surplus of an insurance company. All surplus is invested in the risky asset, the price of which follows a geometric Brownian motion.…

Probability · Mathematics 2014-03-28 Yuliya Mishura , Mykola Perestyuk , Olena Ragulina

Based on a discrete version of the Pollaczeck-Khinchine formula, a general method to calculate the ultimate ruin probability in the Gerber-Dickson risk model is provided when claims follow a negative binomial mixture distribution. The…

Probability · Mathematics 2020-06-03 David J. Santana , Luis Rincon

We study the following game. Three players start with initial capitals of $s_{1},s_{2},s_{3}$ dollars; in each round player $P_{m}$ is selected with probability $\frac{1}{3}$; then \emph{he} selects player $P_{n}$ and they play a game in…

Computer Science and Game Theory · Computer Science 2024-06-13 Ath. Kehagias , G. Gkyzis , A. Karakoulakis , A. Kyprianidis

The discrete time risk model with two seasons and dependent claims is considered. An algorithm is created for computing the values of the ultimate ruin probability. Theoretical results are illustrated with numerical examples.

Probability · Mathematics 2020-01-13 Olga Navickienė , Jonas Sprindys , Jonas Šiaulys

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

Probability · Mathematics 2013-03-01 T. J. van Uem

In a guessing game, players guess the value of a random real number selected using some probability density function. The winner may be determined in various ways; for example, a winner can be a player whose guess is closest in magnitude to…

Computer Science and Game Theory · Computer Science 2016-07-11 Anthony Mendes , Kent E. Morrison

In this paper, we introduce a notion of generalized potential games that is inspired by a newly developed theory on generalized gradient flows. More precisely, a game is called generalized potential if the simultaneous gradient of the loss…

Computer Science and Game Theory · Computer Science 2019-08-20 M. H. Duong , T. H. Dang-Ha , Q. B. Tang , H. M. Tran

A valuation for a player in a game in extensive form is an assignment of numeric values to the players moves. The valuation reflects the desirability moves. We assume a myopic player, who chooses a move with the highest valuation.…

Machine Learning · Computer Science 2007-05-23 Philippe Jehiel , Dov Samet

We study statistics of the knockout tournament, where only the winner of a fixture progresses to the next. We assign a real number called competitiveness to each contestant and find that the resulting distribution of prize money follows a…

Physics and Society · Physics 2014-01-09 Seung Ki Baek , Il Gu Yi , Hye Jin Park , Beom Jun Kim

In this expository note, we give a simple proof that a gambler repeating a game with positive expected value never goes broke with a positive probability. This does not immediately follow from the strong law of large numbers or other basic…

Probability · Mathematics 2021-05-11 Calvin Wooyoung Chin

In ruin theory, the net profit condition intuitively means that the incurred random claims on average do not occur more often than premiums are gained. The breach of the net profit condition causes guaranteed ruin in few but simple cases…

Probability · Mathematics 2024-01-08 Andrius Grigutis , Arvydas Karbonskis , Jonas Šiaulys

Define a certain gambler's ruin process $\mathbf{X}_{j}, \mbox{ \ }j\ge 0,$ such that the increments $\varepsilon_{j}:=\mathbf{X}_{j}-\mathbf{X}_{j-1}$ take values $\pm1$ and satisfy $P(\varepsilon_{j+1}=1|\varepsilon_{j}=1,…

Probability · Mathematics 2018-05-22 Gregory J. Morrow

The General Lotto game is a popular variant of the famous Colonel Blotto game, in which two opposing players allocate limited resources over many battlefields. In this paper, we consider incomplete and asymmetric information formulations…

Computer Science and Game Theory · Computer Science 2022-10-18 Keith Paarporn , Rahul Chandan , Mahnoosh Alizadeh , Jason R. Marden

How do large-scale participants in parimutuel wagering events affect the house and ordinary bettors? A standard narrative suggests that they may temporarily benefit the former at the expense of the latter. To approach this problem, we begin…

Optimization and Control · Mathematics 2017-03-30 Erhan Bayraktar , Alexander Munk

Online gambling sites offer many different gambling games. In this work we analyse the gambling logs of numerous solely probability-based gambling games and extract the wager and odds distributions. We find that the log-normal distribution…

Physics and Society · Physics 2019-10-14 Xiangwen Wang , Michel Pleimling

We analyze the classical Brownian risk models discussing the approximation of ruin probabilities (classical, {\gamma}-reflected, Parisian and cumulative Parisian) for the case that ruin can occur only on specific discrete grids. A practical…

Probability · Mathematics 2020-01-29 Grigori Jasnovidov

We consider extensive form win-lose games over a complete binary-tree of depth $n$ where players act in an alternating manner. We study arguably the simplest random structure of payoffs over such games where 0/1 payoffs in the leafs are…

Computer Science and Game Theory · Computer Science 2019-09-11 Urban Larsson , Yakov Babichenko