A person is employed for one day at a time. When he is out of work, he visits the job agency in the morning to see if there is work for that day. There is a job for her with probability $\frac{1}{2}$. If there is no work, he comes back the next day. When he has a job, he will be called back to the same job for the next day with probability $\frac{2}{3}$. When he is not called back, he goes to the job agency again the next morning to look for a new job. Approximate the average number of jobs the person works in a year.
My approach :
Let us denote $p_n$ as the probability that he has a job on day $n$. By the law of total probability,
$P[$Job on Day $n] = P[$ Job on Day $n \ \cap$ same job as Day $n-1$$] + P[$ Job on Day $n \ \cap$ different or no job as Day $n-1$$]$.
This implies the recursion :
$p_n = \frac{2}{3} p_{n-1} + \frac{1}{2}(1-p_{n-1})$.
Solving this recursion and I guess introducing the total number of jobs as a sum of indicators will give my expected number of jobs in a year.
But I feel a bit weird about this recursion and I think it is not correct. Can anyone have a different approach to this?
I'd look at this as a Markov Chain with two states $J$ (job) and $N$ (no job). Draw the transition probabilities. Then assume at steady state there's a $p_J$ and $p_N$. Set up your equations $(p_J = \dfrac 23 p_J + \dfrac 12 p_N$ and $p_N = \dfrac 13 p_J + \dfrac12 p_N)$. Solving those I get $p_J = \dfrac 35$, so 60% of the time she has a job on any given day (in steady state).