Stochastic Shortest Path Games

DOI10.1137/S0363012996299557zbMath0918.90148MaRDI QIDQ4253012

Dimitri P. Bertsekas, Stephen D. Patek

Publication date: 24 June 1999

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

zbMATH Keywords

optimizationgame theorydynamic programmingstochastic 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)

Related Items (11)

Play Like the Pros? Solving the Game of Darts as a Dynamic Zero-Sum Game ⋮ Error bounds for stochastic shortest path problems ⋮ Regular Policies in Abstract Dynamic Programming ⋮ Identity concealment games: how I learned to stop revealing and love the coincidences ⋮ On probability-raising causality in Markov decision processes ⋮ Foundations of probability-raising causality in Markov decision processes ⋮ Real-time dynamic programming for Markov decision processes with imprecise probabilities ⋮ On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost ⋮ On terminating Markov decision processes with a risk-averse objective function ⋮ Perseverance and suspense in tug-of-war ⋮ Robust shortest path planning and semicontractive dynamic programming

This page was built for publication: Stochastic Shortest Path Games