Karel Sladký

According to our database, Karel Sladký authored at least 26 papers between 1967 and 2018.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2018

Risk-sensitive average optimality in Markov decision processes.

Karel Sladký

Kybernetika, 2018

2017

Second order optimality in Markov decision chains.

Karel Sladký

Kybernetika, 2017

2015

Sample-Path Optimal Stationary Policies in Stable Markov Decision Chains with the Average Reward Criterion.

Rolando Cavazos-Cadena, Raúl Montes-de-Oca, Karel Sladký

J. Appl. Probab., 2015

2014

A Counterexample on Sample-Path Optimality in Stable Markov Decision Chains with the Average Reward Criterion.

Rolando Cavazos-Cadena, Raúl Montes-de-Oca, Karel Sladký

J. Optim. Theory Appl., 2014

2010

Identification of optimal policies in Markov decision processes.

Karel Sladký

Kybernetika, 2010

2008

Growth rates and average optimality in risk-sensitive Markov decision chains.

Karel Sladký

Kybernetika, 2008

Editorial: Sixty years of cybernetics.

Lucie Fajfrová, Milan Mares, Karel Sladký

Kybernetika, 2008

2007

Risk-Sensitive Average Optimality in Markov Decision Chains.

Karel Sladký, Raúl Montes-de-Oca

Proceedings of the Operations Research, 2007

2006

Monotonicity and comparison results for nonnegative dynamic systems. Part II: Continuous-time case.

Nico M. van Dijk, Karel Sladký

Kybernetika, 2006

Monotonicity and comparison results for nonnegative dynamic systems. Part I: Discrete-time case.

Nico M. van Dijk, Karel Sladký

Kybernetika, 2006

Risk-Sensitive Optimality Criteria in Markov Decision Processes.

Karel Sladký

Proceedings of the Operations Research, 2006

2005

On mean reward variance in semi-Markov processes.

Karel Sladký

Math. Methods Oper. Res., 2005

Algorithmic Procedures for Mean Variance Optimality in Markov Decision Chains.

Karel Sladký, Milan Sitar

Proceedings of the Operations Research Proceedings 2005, 2005

2004

Total Reward Variance in Discrete and Continuous Time Markov Chains.

Karel Sladký, Nico M. van Dijk

Proceedings of the Operations Research, 2004

1994

On sufficient conditions for the stability of dynamic interval systems.

Karel Sladký

Kybernetika, 1994

1993

Special issue: Nondifferentiable Problems in Optimal Design.

Karel Sladký

Kybernetika, 1993

1981

On the existence of stationary optimal policies in discrete dynamic programming.

Karel Sladký

Kybernetika, 1981

Bounds on discrete dynamic programming recursions. II. Polynomial bounds on problems with block-triangular structure.

Karel Sladký

Kybernetika, 1981

1980

Bounds on discrete dynamic programming recursions. I. Models with non-negative matrices.

Karel Sladký

Kybernetika, 1980

1977

Sensitive Optimality Criteria in Countable State Dynamic Programming.

Arie Hordijk, Karel Sladký

Math. Oper. Res., 1977

1974

On the set of optimal controls for Markov chains with rewards.

Karel Sladký

Kybernetika, 1974

1973

Necessary and sufficient optimality conditions for average reward of controlled Markov chains.

Karel Sladký

Kybernetika, 1973

1969

On the method of successive approximations for finding the optimal control of a Markov chain.

Karel Sladký

Kybernetika, 1969

1968

On Eaton-Zadeh's method.

Karel Sladký

Kybernetika, 1968

A note on the programming in Markov-type processes.

Karel Sladký

Kybernetika, 1968

1967

A problem concerning an optimal service policy for several facilities.

Karel Sladký

Kybernetika, 1967