Pages that link to "Item:Q2440756"
From MaRDI portal
The following pages link to Exact finite approximations of average-cost countable Markov decision processes (Q2440756):
Displaying 12 items.
- Solving average cost Markov decision processes by means of a two-phase time aggregation algorithm (Q300040) (← links)
- Potentials based optimization with embedded Markov chain for stochastic constrained system (Q437320) (← links)
- Fuzzy Markovian decision processes: application to queueing systems (Q623201) (← links)
- Time aggregated Markov decision processes via standard dynamic programming (Q635510) (← links)
- Finite state approximation algorithms for average cost denumerable state Markov decision processes (Q1066819) (← links)
- A multi-cluster time aggregation approach for Markov chains (Q1716687) (← links)
- Revenue management for operations with urgent orders (Q2629651) (← links)
- On some algorithms for limiting average Markov decision processes (Q2643806) (← links)
- Discounted Continuous-Time Controlled Markov Chains: Convergence of Control Models (Q4903043) (← links)
- On the Minimum Pair Approach for Average Cost Markov Decision Processes with Countable Discrete Action Spaces and Strictly Unbounded Costs (Q5220188) (← links)
- Approximation of average cost Markov decision processes using empirical distributions and concentration inequalities (Q5265786) (← links)
- Algorithms for Countable State Markov Decision Models with an Absorbing Set (Q5317111) (← links)
