We introduce a journey planning problem in multi-modal transportation networks under uncertainty. The goal is to find a journey, possibly involving transfers between different transport services, from a given origin to a given destination within a specified time horizon. Due to uncertainty in...

This paper deals with a Markovian decision process with an absorbing set J 0 . We are interested in the largest number β *≥1, called the critical discount factor, such that for all discount factors β smaller than β * the limit V of the N-stage value function V N for N →∞ exists and is...

This paper deals with a Markovian decision process with an absorbing set J <Subscript>0</Subscript>. We are interested in the largest number β<Superscript>*</Superscript>≥1, called the critical discount factor, such that for all discount factors β smaller than β<Superscript>*</Superscript> the limit V of the N-stage value function V <Subscript>N</Subscript> for N →∞ exists and is...</subscript></superscript></superscript></subscript>