Expected total reward collected by a Markov chain over the
times \(0, 1, \dots, n\), for every initial state, when state \(i\)
pays rewards[i] at each visit.
Arguments
- markovchain
A
markovchainobject.- n
Number of steps, a non-negative integer.
- rewards
Numeric vector with the reward of each state, in the order of
states(markovchain).
Details
The values solve the dynamic programming recursion \(v_0 = r\), \(v_k = r + P v_{k-1}\) (Gallager 2013, Section 3.5), so that \(v_n = \sum_{k=0}^{n} P^k r\).
References
Gallager, R. G. (2013). Stochastic Processes: Theory for Applications. Cambridge University Press.
See also
Other rewards:
expectedRewardsBeforeHittingA()