View Author
policy state f ~ f decision hordijk laurent series expansion assumption optimality function dekker chain policy f vector i ~ e blackwell tableau simplex tableau solution reward element programming matrix series simplex theorem laurent action semi-markov markov interval process lemma system expansion polynomial j ~ c state i equation computation denumerable problem pointwise method existence blackwell optimality coefficient degree j ~ e proof pointwise continuity discount continuity order model numerator value service transition result variable i e e ~176 optimality equations laurent series probability simplex method analysis operator number h ~ f network field discount factor degree n i ~ c space time t denominator procedure theory
6 Most Recent Publications
|
On the relation between recurrence and ergodicity properties in denumerable Markov decision chains
(Article)
Dekker, R. Hordijk, A. Spieksma, F.M. |
1994-08-01
|
|
Recurrence conditions for average and Blackwell optimality in denumerable state Markov decision chains.
(Article)
Dekker, R. Hordijk, A. |
1992-01-01
|
|
Denumerable Markov decision chains: sensitive optimality criteria
(Article)
Hordijk, A. Dekker, R. |
1991-12-01
|
|
Denumerable Semi-Markov Decision Chains with Small Interest Rates
(Article)
Dekker, R. Hordijk, A. |
1991-01-01
|
|
Average, sensitive and Blackwell-optimal policies in denumerable Markov decision chains with unbounded rewards
(Article)
Dekker, R. Hordijk, A. |
1988-08-01
|
|
Sensitivity analysis in discounted Markovian decison problems
(Article)
Hordijk, A. Dekker, R. Kallenberg, L.C.M. |
1985-09-01
|