The attached file may be somewhat different from the published versionInternational audienceIn this paper, we discuss the comparison of expected rewards for discrete-time reward Markov chains with different state spaces. Necessary and sufficient conditions for such a comparison are derived. Due to the special nature of the introduced binary relation, a criterion may be formulated in terms of an inclusion of polyhedral sets. Then, algebraic and geometric forms are easily obtained from Haar's Lemma. Our results allow us to discuss some earlier results on the stochastic comparison of functions of Markov chains
International audienceSolving Markov chains is, in general, difficult if the state space of the chai...
summary:In two subsequent parts, Part I and II, monotonicity and comparison results will be studied,...
summary:In two subsequent parts, Part I and II, monotonicity and comparison results will be studied,...
The attached file may be somewhat different from the published versionInternational audienceIn this ...
The attached file may be somewhat different from the published versionInternational audienceIn this ...
summary:Haar's Lemma (1918) deals with the algebraic characterization of the inclusion of polyhedral...
summary:Haar's Lemma (1918) deals with the algebraic characterization of the inclusion of polyhedral...
AbstractIn the present paper the expected average reward criterion is considered instead of the aver...
summary:Haar's Lemma (1918) deals with the algebraic characterization of the inclusion of polyhedral...
Costs and rewards are important ingredients for many types of systems, modelling critical aspects li...
We study the optimization of average rewards of discrete time nonhomogeneous Markov chains, in which...
This presentation introduces the Markov Reward Automaton (MRA), an extension of the Markov automaton...
AbstractIn the present paper the expected average reward criterion is considered instead of the aver...
summary:The article is devoted to Markov reward chains in discrete-time setting with finite state sp...
summary:The article is devoted to Markov reward chains in discrete-time setting with finite state sp...
International audienceSolving Markov chains is, in general, difficult if the state space of the chai...
summary:In two subsequent parts, Part I and II, monotonicity and comparison results will be studied,...
summary:In two subsequent parts, Part I and II, monotonicity and comparison results will be studied,...
The attached file may be somewhat different from the published versionInternational audienceIn this ...
The attached file may be somewhat different from the published versionInternational audienceIn this ...
summary:Haar's Lemma (1918) deals with the algebraic characterization of the inclusion of polyhedral...
summary:Haar's Lemma (1918) deals with the algebraic characterization of the inclusion of polyhedral...
AbstractIn the present paper the expected average reward criterion is considered instead of the aver...
summary:Haar's Lemma (1918) deals with the algebraic characterization of the inclusion of polyhedral...
Costs and rewards are important ingredients for many types of systems, modelling critical aspects li...
We study the optimization of average rewards of discrete time nonhomogeneous Markov chains, in which...
This presentation introduces the Markov Reward Automaton (MRA), an extension of the Markov automaton...
AbstractIn the present paper the expected average reward criterion is considered instead of the aver...
summary:The article is devoted to Markov reward chains in discrete-time setting with finite state sp...
summary:The article is devoted to Markov reward chains in discrete-time setting with finite state sp...
International audienceSolving Markov chains is, in general, difficult if the state space of the chai...
summary:In two subsequent parts, Part I and II, monotonicity and comparison results will be studied,...
summary:In two subsequent parts, Part I and II, monotonicity and comparison results will be studied,...