Stochastic Shortest Path Games

DOI10.1137/S0363012996299557MaRDI QIDQ4253012zbMATHFDO

Authors Stephen D. Patek, Dimitri P. Bertsekas

Publication date 24 June 1999

Published in SIAM Journal on Control and Optimization (Search for Journal in Brave)

zbMATH Keywords

optimizationdynamic programminggame theorystochastic gamesstochastic shortest paths

Mathematics Subject Classification ID

Dynamic programming in optimal control and differential games (49L20) Stochastic games, stochastic differential games (91A15) Probabilistic games; gambling (91A60)

Recommendations

• An Analysis of Stochastic Shortest Path Problems
• Zero-sum stochastic games with unbounded costs: Discounted and average cost cases
• Two-person zero-sum stochastic games
• Nonzero-sum stochastic games with unbounded costs: Discounted and average cost cases

Cited in

(18)

• Robust shortest path planning and semicontractive dynamic programming
• Foundations of probability-raising causality in Markov decision processes
• Bounding fixed points of set-based Bellman operator and Nash equilibria of stochastic games
• Modeling shortest path games with Petri nets: a Lyapunov based theory
• The stochastic shortest path problem: a polyhedral combinatorics perspective
• Perseverance and suspense in tug-of-war
• On probability-raising causality in Markov decision processes
• Playing Against Fair Adversaries in Stochastic Games with Total Rewards
• Play Like the Pros? Solving the Game of Darts as a Dynamic Zero-Sum Game
• scientific article; zbMATH DE number 5121085 (Why is no real title available?)
• Regular policies in abstract dynamic programming
• scientific article; zbMATH DE number 1944081 (Why is no real title available?)
• On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost
• The stochastic shortest-path problem for Markov chains with infinite state space with applications to nearest-neighbor lattice chains
• On terminating Markov decision processes with a risk-averse objective function
• Real-time dynamic programming for Markov decision processes with imprecise probabilities
• Identity concealment games: how I learned to stop revealing and love the coincidences
• Error bounds for stochastic shortest path problems

This page was built for publication: Stochastic Shortest Path Games

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