We consider a discrete time Markov Decision Process with infinite horizon. The criterion to be maximized is the sum of a number of standard discounted rewards, each with a different discount factor.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback