Shortest Route Methods for Finite State Space Deterministic Dynamic Programming Problems

1968 ◽  
Vol 16 (6) ◽  
pp. 1232-1250 ◽  
Author(s):  
Jeremy F. Shapiro
Keyword(s):  
Dynamic Programming ◽  
State Space ◽  
Deterministic Dynamic ◽  
Shortest Route ◽  
Finite State ◽  
Finite State Space

Rate modulation in dams and ruin problems

1996 ◽  
Vol 33 (2) ◽  
pp. 523-535 ◽  
Author(s):  
Søren Asmussen ◽  
Offer Kella
Keyword(s):  
State Space ◽  
Release Rate ◽  
Risk Process ◽  
The State ◽  
Limiting Distribution ◽  
Process Conditions ◽  
Explicit Formulas ◽  
Rate Modulation ◽  
Finite State ◽  
Finite State Space

We consider a dam in which the release rate depends both on the state and some modulating process. Conditions for the existence of a limiting distribution are established in terms of an associated risk process. The case where the release rate is a product of the state and the modulating process is given special attention, and in particular explicit formulas are obtained for a finite state space Markov modulation.

scholarly journals Conditioning an additive functional of a Markov chain to stay nonnegative. I. Survival for a long time

2005 ◽  
Vol 37 (4) ◽  
pp. 1015-1034 ◽  
Author(s):  
Saul D. Jacka ◽  
Zorana Lazic ◽  
Jon Warren
Keyword(s):  
Markov Chain ◽  
Weak Convergence ◽  
State Space ◽  
Continuous Time ◽  
Additive Functional ◽  
Finite State ◽  
Long Time ◽  
Negative Drift ◽  
Irreducible Markov Chain ◽  
Finite State Space

Let (Xt)t≥0 be a continuous-time irreducible Markov chain on a finite state space E, let v be a map v: E→ℝ\{0}, and let (φt)t≥0 be an additive functional defined by φt=∫0tv(Xs)d s. We consider the case in which the process (φt)t≥0 is oscillating and that in which (φt)t≥0 has a negative drift. In each of these cases, we condition the process (Xt,φt)t≥0 on the event that (φt)t≥0 is nonnegative until time T and prove weak convergence of the conditioned process as T→∞.

Sign in / Sign up

Export Citation Format

Share Document