English
Related papers

Related papers: Extended gambler's ruin problem

200 papers

We propose an extensive-form solution concept, with players that neglect information from hypothetical events, but make inferences from observed events. Our concept modifies cursed equilibrium (Eyster and Rabin, 2005), and allows that…

Theoretical Economics · Economics 2025-07-29 Shani Cohen , Shengwu Li

We introduce a simple extension of the minority game in which the market rewards contrarian (resp. trend-following) strategies when it is far from (resp. close to) efficiency. The model displays a smooth crossover from a regime where…

Disordered Systems and Neural Networks · Physics 2009-11-10 A. De Martino , I. Giardina , M. Marsili , A. Tedeschi

As a strategy to complete games quickly, we investigate one-dimensional random walks where the step length increases deterministically upon each return to the origin. When the step length after the kth return equals k, the displacement of…

Statistical Mechanics · Physics 2009-11-10 E. Ben-Naim , S. Redner

This paper develops asymptotics and approximations for ruin probabilities in a multivariate risk setting. We consider a model in which the individual reserve processes are driven by a common Markovian environmental process. We subsequently…

Probability · Mathematics 2018-12-24 G. A. Delsing , M. R. H. Mandjes , P. J. C. Spreij , E. M. M. Winands

We consider a centered random walk with finite variance and investigate the asymptotic behaviour of the probability that the area under this walk remains positive up to a large time $n$. Assuming that the moment of order $2+\delta$ is…

Probability · Mathematics 2012-07-11 Denis Denisov , Vitali Wachtel

We study a new modification of the Arrival problem, which allows for nodes that exhibit random as well as controlled behaviour, in addition to switching nodes. We study the computational complexity of these extensions, building on existing…

Computational Complexity · Computer Science 2024-09-17 Thomas Webster

In this note, we investigate combinatorial games where both players move randomly (each turn, independently selecting a legal move uniformly at random). In this model, we provide closed-form expressions for the expected number of turns in a…

Combinatorics · Mathematics 2024-01-31 Pat Devlin , Paulina Trifonova

We study the persistence probability for some discrete-time, time-reversible processes. In particular, we deduce the persistence exponent in a number of examples: first, we deal with random walks in random sceneries (RWRS) in any dimension…

Probability · Mathematics 2015-02-25 Frank Aurzada , Nadine Guillotin-Plantard

In this paper, we consider mean-field games where the interaction of each player with the mean-field takes into account not only the states of the players but also their collective behavior, To do so, we develop a random variable framework…

Analysis of PDEs · Mathematics 2015-06-23 Diogo A. Gomes , Vardan K. Voskanyan

In a two-stage repeated classical game of prisoners' dilemma the knowledge that both players will defect in the second stage makes the players to defect in the first stage as well. We find a quantum version of this repeated game where the…

Quantum Physics · Physics 2015-06-26 A. Iqbal , A. H. Toor

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

In this paper, we study Grover walks on a line with one and two absorbing boundaries. In particular, we present some results for the absorbing probabilities both in a semi-finite and finite line. Analytical expressions for these absorbing…

Quantum Physics · Physics 2016-12-13 Kun Wang , Nan Wu , Parker Kuklinski , Ping Xu , Haixing Hu , Fangmin Song

Let $\textbf{Z}(t)=(Z_1(t) ,\ldots, Z_d(t))^\top , t \in \mathbb{R}$ where $Z_i(t), t\in \mathbb{R}$, $i=1,...,d$ are mutually independent centered Gaussian processes with continuous sample paths a.s. and stationary increments. For…

Probability · Mathematics 2021-10-27 Krzysztof Bisewski , Krzysztof Debicki , Nikolai Kriukov

In the best choice problem with random arrivals, an unknown number $n$ of rankable items arrive at times sampled from the uniform distribution. As is well known, a real-time player can ensure stopping at the overall best item with…

Probability · Mathematics 2021-03-09 Alexander Gnedin

Using the results of precise large deviation and renewal theory for widely dependent random variables, this paper obtains the asymptotic estimation of the random-time ruin probability and the uniform asymptotic estimation of finite-time…

Probability · Mathematics 2025-06-24 Yang Chen , Zhaolei Cui , Yuebao Wang

In this paper we consider a compound Poisson risk model with regularly varying claim sizes. For this model in [1] an asymptotic formula for the finite time ruin probability is provided when the time is scaled by the mean excess function. In…

Probability · Mathematics 2011-12-13 Søren Asmussen , Dominik Kortschak

We consider two-stage robust optimization problems, which can be seen as games between a decision maker and an adversary. After the decision maker fixes part of the solution, the adversary chooses a scenario from a specified uncertainty…

Optimization and Control · Mathematics 2022-01-03 Marc Goerigk , Stefan Lendl , Lasse Wulf

The study deals with the ruin problem when an insurance company having two business branches, life insurance and non-life insurance, invests its reserve into a risky asset with the price dynamics given by a geometric Brownian motion. We…

Probability · Mathematics 2020-11-17 Yuri Kabanov , Nikita Pukhlyakov

In the classical leader election procedure all players toss coins independently and those who get tails leave the game, while those who get heads move to the next round where the procedure is repeated. We investigate a generalizion of this…

Probability · Mathematics 2017-03-02 Gerold Alsmeyer , Zakhar Kabluchko , Alexander Marynych

We consider two-player turn-based games with zero-reachability and zero-safety objectives generated by extended vector addition systems with states. Although the problem of deciding the winner in such games is undecidable in general, we…

Computer Science and Game Theory · Computer Science 2010-02-15 Tomas Brazdil , Petr Jancar , Antonin Kucera