We have a gambler who at each step wins and loses $1$ dollar with probability $p$ and $1-p$ respectively. The game ends when he loses everything or wins $m$ dollar. Now starting with $i$ dollar the probability of winning $m$ dollar with $p = \frac{1}{2}$ comes out to be $\frac{i}{m}$. I want to know the intuitive argument behind this
2026-04-13 00:49:17.1776041357
Intuitive argument in case of a problem on Gambler's ruin
318 Views Asked by user21982 https://math.techqa.club/user/user21982/detail At
1
There are 1 best solutions below
Related Questions in PROBABILITY
- How to prove $\lim_{n \rightarrow\infty} e^{-n}\sum_{k=0}^{n}\frac{n^k}{k!} = \frac{1}{2}$?
- Is this a commonly known paradox?
- What's $P(A_1\cap A_2\cap A_3\cap A_4) $?
- Prove or disprove the following inequality
- Another application of the Central Limit Theorem
- Given is $2$ dimensional random variable $(X,Y)$ with table. Determine the correlation between $X$ and $Y$
- A random point $(a,b)$ is uniformly distributed in a unit square $K=[(u,v):0<u<1,0<v<1]$
- proving Kochen-Stone lemma...
- Solution Check. (Probability)
- Interpreting stationary distribution $P_{\infty}(X,V)$ of a random process
Related Questions in MARKOV-CHAINS
- Calculating probabilities using Markov chains.
- Probability being in the same state
- Random walk on $\mathbb{Z}^2$
- Polya's Urn and Conditional Independence
- Markov Chain never reaches a state
- Finding a mixture of 1st and 0'th order Markov models that is closest to an empirical distribution
- Find probability function of random walk, stochastic processes
- Generating cycles on a strongly connected graph
- Will be this random walk a Markov chain?
- An irreducible Markov chain cannot have an absorbing state
Related Questions in CONDITIONAL-PROBABILITY
- Given $X$ Poisson, and $f_{Y}(y\mid X = x)$, find $\mathbb{E}[X\mid Y]$
- Finding the conditional probability given the joint probability density function
- Easy conditional probability problem
- Conditional probability where the conditioning variable is continuous
- probability that the machine has its 3rd malfunction on the 5th day, given that the machine has not had three malfunctions in the first three days.
- Sum of conditional probabilities equals 1?
- Prove or disprove: If $X | U$ is independent of $Y | V$, then $E[XY|U,V] = E[X|U] \cdot E[Y|V]$.
- Conditional probability and binomial distribution
- Intuition behind conditional probabilty: $P(A|B)=P(B\cap A)/P(B)$
- Transition Probabilities in Discrete Time Markov Chain
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Let $X_i$ be the outcome of game $i$. $$\mathbb P[X_i=1]=p, \space \mathbb P[X_i=-1]=(1-p)$$ When $$p=1-p=\frac12$$ we're dealing with a symmetric random walk problem. Let $$S_n = \sum_{i=1}^n X_i$$ be the sum of winnings up to the time $n$. We'll define a stopping time $$\tau = \inf\{n:S_0=0, S_n=M \vee S_n=-I\}$$ That is: starting at $S_0=0$ we stop either if we win M or if we lose I.
As you might notice, $S_n$ is a martingale: $$\mathbb{E}[S_n | \mathcal{F}_{n-1}] = S_{n-1}$$ and (most importantly) $$\mathbb{E}S_{\tau}=0$$
Now we'll proceed computing the expectation of winnings at the stopping time $\tau$ \begin{align} \mathbb{E}S_{\tau} =0 &= M \mathbb P[S_{\tau}=M] -I \mathbb P[S_{\tau}=-I] \\ &=M \mathbb P[S_{\tau}=M] -I \Bigg(1- \mathbb P[S_{\tau}=M] \Bigg)\\ \end{align} By the way, since there are only two ways to end this game (by the definition of $\tau$, then $$ \mathbb P[S_{\tau}=-I]= 1- \mathbb P[S_{\tau}=M]$$ must be true. Therefore, $$I=(M+I) \mathbb P[S_{\tau}=M]\\ \mathbb P[S_{\tau}=M] = \frac{I}{M+I}$$
Intuition: it's only the range $(-I,M)$ that matters. Symmetric random walk is basically a discrete version of Brownian motion, so you can try to visualize it like a particle moving randomly in the X-Y plane...winning if it reaches the upper bound, going broke if it hits the lower bound.