In the spirit of Surya [22], we develop an average problem approach to prove the optimality of threshold type strategies for optimal stopping of Lévy models with a continuous additive functional (CAF) discounting. Under spectrally negative models, we specialize this in terms of conditions on the reward function and random discounting, where we present two examples of local time and occupation time discounting. We then apply this approach to recursive optimal stopping problems, and present simpler and neater proofs for a number of important results on qualitative properties of the optimal thresholds, which are only known under a few special cases [3,15,23]. . 1 By considering the Lévy process −X·, one can easily adjust the argument to incorporate the running minimum of X·.where M is a random variable whose law under P Xt is identical to the conditional law of sup [t,ζ] X s under P x given F t and {t < ζ}.Second, we identify v(·) as the expected payoff of the up-crossing strategyIn fact, for any z ∈ R, by conditioning,On the event {T + z < ζ}, the identitywhere M is a random variable whose law under P X T + z is identical to the conditional law of sup t∈[T + z ,ζ] X t under P x given F T + z and {T + z < ζ}, from which the last equality results. It follows from the tower property of conditional expectations that