Existence of a solution to the Markov renewal programming problem
From MaRDI portal
Recommendations
- A Fixed Point Approach to Undiscounted Markov Renewal Programs
- A Brouwer fixed-point mapping approach to communicating Markov decision processes
- Bounds on the fixed point of a monotone contraction operator
- scientific article; zbMATH DE number 5883690
- Contraction mappings underlying undiscounted Markov decision problems. II
Cites work
Cited in
(5)- The minimal solution of a Markov renewal equation
- scientific article; zbMATH DE number 67927 (Why is no real title available?)
- A Brouwer fixed-point mapping approach to communicating Markov decision processes
- Replacement process decomposition for discounted Markov renewal programming
- A Fixed Point Approach to Undiscounted Markov Renewal Programs
This page was built for publication: Existence of a solution to the Markov renewal programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108206)