Karel Sladký

Publication Activity (10 Years)

Years Active: 1967-2018
Publications (10 Years): 3

Top Topics

Stationary Policies

Top Venues

J. Optim. Theory Appl.

J. Appl. Probab.

Publications

Karel Sladký
Risk-sensitive average optimality in Markov decision processes. Kybernetika 54 (6) (2018)
Karel Sladký
Second order optimality in Markov decision chains. Kybernetika 53 (6) (2017)
Rolando Cavazos-Cadena, Raúl Montes-de-Oca, Karel Sladký
Sample-Path Optimal Stationary Policies in Stable Markov Decision Chains with the Average Reward Criterion. J. Appl. Probab. 52 (2) (2015)
Rolando Cavazos-Cadena, Raúl Montes-de-Oca, Karel Sladký
A Counterexample on Sample-Path Optimality in Stable Markov Decision Chains with the Average Reward Criterion. J. Optim. Theory Appl. 163 (2) (2014)
Karel Sladký
Identification of optimal policies in Markov decision processes. Kybernetika 46 (3) (2010)
Karel Sladký
Growth rates and average optimality in risk-sensitive Markov decision chains. Kybernetika 44 (2) (2008)
Lucie Fajfrová, Milan Mares, Karel Sladký
Editorial: Sixty years of cybernetics. Kybernetika 44 (3) (2008)
Karel Sladký, Raúl Montes-de-Oca
Risk-Sensitive Average Optimality in Markov Decision Chains. OR (2007)
Nico M. van Dijk, Karel Sladký
Monotonicity and comparison results for nonnegative dynamic systems. Part I: Discrete-time case. Kybernetika 42 (1) (2006)
Nico M. van Dijk, Karel Sladký
Monotonicity and comparison results for nonnegative dynamic systems. Part II: Continuous-time case. Kybernetika 42 (2) (2006)
Karel Sladký
Risk-Sensitive Optimality Criteria in Markov Decision Processes. OR (2006)
Karel Sladký, Milan Sitar
Algorithmic Procedures for Mean Variance Optimality in Markov Decision Chains. OR (2005)
Karel Sladký
On mean reward variance in semi-Markov processes. Math. Methods Oper. Res. 62 (3) (2005)
Karel Sladký, Nico M. van Dijk
Total Reward Variance in Discrete and Continuous Time Markov Chains. OR (2004)
Karel Sladký
On sufficient conditions for the stability of dynamic interval systems. Kybernetika 30 (5) (1994)
Karel Sladký
Special issue: Nondifferentiable Problems in Optimal Design. Kybernetika 29 (3) (1993)
Karel Sladký
Bounds on discrete dynamic programming recursions. II. Polynomial bounds on problems with block-triangular structure. Kybernetika 17 (4) (1981)
Karel Sladký
On the existence of stationary optimal policies in discrete dynamic programming. Kybernetika 17 (6) (1981)
Karel Sladký
Bounds on discrete dynamic programming recursions. I. Models with non-negative matrices. Kybernetika 16 (6) (1980)
Arie Hordijk, Karel Sladký
Sensitive Optimality Criteria in Countable State Dynamic Programming. Math. Oper. Res. 2 (1) (1977)
Karel Sladký
On the set of optimal controls for Markov chains with rewards. Kybernetika 10 (4) (1974)
Karel Sladký
Necessary and sufficient optimality conditions for average reward of controlled Markov chains. Kybernetika 9 (2) (1973)
Karel Sladký
On the method of successive approximations for finding the optimal control of a Markov chain. Kybernetika 5 (2) (1969)
Karel Sladký
A note on the programming in Markov-type processes. Kybernetika 4 (2) (1968)
Karel Sladký
On Eaton-Zadeh's method. Kybernetika 4 (4) (1968)
Karel Sladký
A problem concerning an optimal service policy for several facilities. Kybernetika 3 (4) (1967)