A three-player gambler's ruin problem: some extensions

For the expected ruin time of the classic three-player symmetric game, Sandell derived a general formula by introducing an appropriate martingale and stopping time. For the case of asymmetric game, the martingale approach is not valid to determine the ruin time. In general, the ruin probabilities for both cases, i.e. symmetric and asymmetric game and expected ruin time for asymmetric game are still awaiting to be solved for this game. The current work is also about three-player gambler’s ruin problem with some extensions as well. We provide expressions for the ruin time with (without) ties when all the players have equal (unequal) initial fortunes. Finally, the validity of asymmetric game is also tested through a Monte Carlo simulation study.

Gambler’s ruin problem and bi-directional grid constrained trading and investment strategies

Bi-Directional Grid Constrained (BGC) trading strategies have never been studied academically until now, are relatively new in the world of financial markets and have the ability to out-perform many other trading algorithms in the short term but will almost surely ruin an investment account in the long term. Whilst the Gambler’s Ruin Problem (GRP) is based on martingales and the established probability theory proves that the GRP is a doomed strategy, this research details how the semimartingale framework is required to solve the grid trading problem (GTP), i.e. a form of BGC financial markets strategies, and how it can deliver greater return on investment (ROI) for the same level of risk. A novel theorem of GTP is derived, proving that grid trading, whilst still subject to the risk of ruin, has the ability to generate significantly more profitable returns in the short term. This is also supported by extensive simulation and distributional analysis. These results not only can be studied within mathematics and statistics in their own right, but also have applications into finance such as multivariate dynamic hedging, investment funds, trading, portfolio risk optimization and algorithmic loss recovery. In today’s uncertain and volatile times, investment returns are between 2%-5% per annum, barely keeping up with inflation, putting people’s retirement at risk. BGC and GTP are thus a rich source of innovation potential for improved trading and investing. Acknowledgement(s)Aldo Taranto was supported by an Australian Government Research Training Program (RTP) Scholarship. The authors would like to thank A/Prof. Ravinesh C. Deo and A/Prof. Ron Addie of the University of Southern Queensland for their invaluable advice on refining this paper.

Bi-directional grid absorption barrier constrained stochastic processes with applications in finance & investment

Whilst the gambler’s ruin problem (GRP) is based on martingales and the established probability theory proves that the GRP is a doomed strategy, this research details how the semimartingale framework is required for the grid trading problem (GTP) of financial markets, especially foreign exchange (FX) markets. As banks and financial institutions have the requirement to hedge their FX exposure, the GTP can help provide a framework for greater automation of the hedging process and help forecast which hedge scenarios to avoid. Two theorems are adapted from GRP to GTP and prove that grid trading, whilst still subject to the risk of ruin, has the ability to generate significantly more profitable returns in the short term. This is also supported by extensive simulation and distributional analysis. We introduce two absorption barriers, one at zero balance (ruin) and one at a specified profit target. This extends the traditional GRP and the GTP further by deriving both the probability of ruin and the expected number of steps (of reaching a barrier) to better demonstrate that GTP takes longer to reach ruin than GRP. These statistical results have applications into finance such as multivariate dynamic hedging (Noorian, Flower, & Leong, 2016), portfolio risk optimization, and algorithmic loss recovery.

SIEGMUND DUALITY FOR MARKOV CHAINS ON PARTIALLY ORDERED STATE SPACES

For a Markov chain on a finite partially ordered state space, we show that its Siegmund dual exists if and only if the chain is Möbius monotone. This is an extension of Siegmund's result for totally ordered state spaces, in which case the existence of the dual is equivalent to the usual stochastic monotonicity. Exploiting the relation between the stationary distribution of an ergodic chain and the absorption probabilities of its Siegmund dual, we present three applications: calculating the absorption probabilities of a chain with two absorbing states knowing the stationary distribution of the other chain; calculating the stationary distribution of an ergodic chain knowing the absorption probabilities of the other chain; and providing a stable simulation scheme for the stationary distribution of a chain provided we can simulate its Siegmund dual. These are accompanied by concrete examples: the gambler's ruin problem with arbitrary winning/losing probabilities; a non-symmetric game; an extension of a birth and death chain; a chain corresponding to the Fisher–Wright model; a non-standard tandem network of two servers, and the Ising model on a circle. We also show that one can construct a strong stationary dual chain by taking the appropriate Doob transform of the Siegmund dual of the time-reversed chain.