I have been reading about discounted MDPs and Stochastic Shortest Path (SSP). I recently came to know (from a friend) that every discounted MDP can be converted to an equivalent SSP but not the other way around. Questions:
- Is this claim true? Is the discount factor equal to 1 when the MDP is converted to an SSP?
- More generally, what is the relationship between these two problem categories?