Deciding Maxmin Reachability in Half-Blind Stochastic Games

DOI10.1007/978-3-662-53354-3_5zbMath1403.91033arXiv1605.07753OpenAlexW2397633251MaRDI QIDQ2819447

Hugo Gimbert, Edon Kelmendi

Publication date: 29 September 2016

Published in: Algorithmic Game Theory (Search for Journal in Brave)

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

zbMATH Keywords

half-blind stochastic gamesmaxmin reachabilitytwo-player stochastic games

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Stochastic games, stochastic differential games (91A15) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)

Related Items (3)

Unnamed Item ⋮ Unnamed Item ⋮ Deciding Maxmin Reachability in Half-Blind Stochastic Games

Cites Work

• Unnamed Item
• On values of repeated games with signals
• Concurrent reachability games
• Deciding Maxmin Reachability in Half-Blind Stochastic Games
• Regular Cost Functions, Part I: Logic and Algebra over Words
• Deciding the value 1 problem for probabilistic leaktight automata
• Decidable Problems for Probabilistic Automata on Infinite Words
• Deciding the Value 1 Problem for Probabilistic Leaktight Automata
• Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
• The Theory of Stabilisation Monoids and Regular Cost Functions
• On semigroups of matrices over the tropical semiring
• Partial-Observation Stochastic Games
• The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies
• Some aspects of probabilistic automata
• Probabilistic automata
• Power of Randomization in Automata on Infinite Strings
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: Deciding Maxmin Reachability in Half-Blind Stochastic Games