The stochastic shortest-path problem for Markov chains with infinite state space with applications to nearest-neighbor lattice chains

DOI10.1007/S00186-013-0427-8zbMATH Open1285.90023OpenAlexW2005844627MaRDI QIDQ2392790FDOQ2392790

Authors: Daniel Lücking, Wolfgang Stadje 

Publication date: 2 August 2013

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-013-0427-8

Recommendations

• An Analysis of Stochastic Shortest Path Problems
• The stochastic shortest path problem: a polyhedral combinatorics perspective
• Stochastic shortest path problems with associative accumulative criteria
• Optimal Stationary Policies in General State Space Markov Decision Chains with Finite Action Sets
• Stochastic Shortest Path Games

zbMATH Keywords

latticeMarkov chaincountable state spacestochastic shortest-path problem

Mathematics Subject Classification ID

Stochastic programming (90C15) Markov and semi-Markov decision processes (90C40)

Cites Work

• Title not available (Why is that?)
• Dynamic programming and optimal control. Vol. 2.
• An Analysis of Stochastic Shortest Path Problems
• On the Speed of Convergence of Value Iteration on Stochastic Shortest-Path Problems
• Randomized Shortest-Path Problems: Two Related Models

This page was built for publication: The stochastic shortest-path problem for Markov chains with infinite state space with applications to nearest-neighbor lattice chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392790)