Stochastic shortest path problems with associative accumulative criteria

DOI10.1016/j.amc.2007.08.025zbMath1156.05031OpenAlexW1990453721MaRDI QIDQ2425975

Yoshio Ohtsubo

Publication date: 17 April 2008

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10126/1194

zbMATH Keywords

invariant imbedding methodMarkov decision processshortest path problemoptimality equationexistence of optimal policyassociative criterion

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38)

Related Items (4)

STOCHASTIC SCENARIO-BASED TIME-STAGE OPTIMIZATION MODEL FOR THE LEAST EXPECTED TIME SHORTEST PATH PROBLEM ⋮ Maximum probability shortest path problem ⋮ Markov decision processes associated with two threshold probability criteria ⋮ Distributionally robust maximum probability shortest path problem

Cites Work

• Equivalence classes for optimizing risk models in Markov decision processes.
• Routing problems and Markovian decision processes
• Minimizing risk models in Markov decision processes with policies depending on target values
• Minimizing risk models in stochastic shortest path problems
• Optimal threshold probability in undiscounted Markov decision processes with a target set.
• Optimal policy for minimizing risk models in Markov decision processes
• Minimising a threshold probability in discounted Markov decision processes
• Finite state Markovian decision processes
• On Sequential Decisions and Markov Chains
• An Analysis of Stochastic Shortest Path Problems
• A Survey of Applications of Markov Decision Processes
• STOCHASTIC DECISION-MAKING IN A FUZZY ENVIRONMENT
• Decision-Making in a Fuzzy Environment
• On Markov policies for minimax decision processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Stochastic shortest path problems with associative accumulative criteria