The stochastic arrival problem

DOI10.1007/978-3-031-19135-0_7arXiv2211.12982OpenAlexW4309956219MaRDI QIDQ6173105

Thomas F. Webster

Publication date: 21 July 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2211.12982

zbMATH Keywords

Markov chainssimple stochastic gamesMDPsarrivalreachability switching games

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• Did the train reach its destination: the complexity of finding a witness
• Games against nature
• The complexity of stochastic games
• The complexity of mean payoff games on graphs
• Fast Parallel Matrix Inversion Algorithms
• ARRIVAL: A Zero-Player Graph Game in NP ∩ coNP
• ARRIVAL: Next Stop in CLS
• Unique End of Potential Line
• Unnamed Item
• Unnamed Item

This page was built for publication: The stochastic arrival problem