scientific article; zbMATH DE number 7204389

DOI10.4230/LIPICS.MFCS.2017.55MaRDI QIDQ5111270zbMATH OpenFDO

Authors Krishnendu Chatterjee, Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen

Publication date 26 May 2020

zbMATH Keywords

reachabilityconcurrent gamessafetypatience of strategies

Mathematics Subject Classification ID

2-person games (91A05) Multistage and repeated games (91A20) Games involving graphs (91A43) Algorithmic game theory and complexity (91A68)

Recommendations

• Strategy improvement for concurrent reachability and turn-based stochastic safety games
• The complexity of ergodic mean-payoff games
• Concurrent reachability games
• The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games
• Termination criteria for solving concurrent safety and reachability games

Cites work

• scientific article; zbMATH DE number 3128726 (Why is no real title available?)
• scientific article; zbMATH DE number 4124989 (Why is no real title available?)
• scientific article; zbMATH DE number 1134975 (Why is no real title available?)
• scientific article; zbMATH DE number 1759629 (Why is no real title available?)
• scientific article; zbMATH DE number 1863184 (Why is no real title available?)
• Alternating-time temporal logic
• Computing uniformly optimal strategies in two-player stochastic games
• Concurrent games with tail objectives
• Concurrent reachability games
• Discounted and positive stochastic games
• Existence of p-Equilibrium and Optimal Stationary Strategies in Stochastic Games
• Fictitious play applied to sequences of games and discounted stochastic games
• Game theory
• On equilibria in repeated games with absorbing states
• Qualitative concurrent parity games
• Recursive Concurrent Stochastic Games
• Solving simple stochastic games with few coin toss positions
• Stochastic Games
• Supervisory Control of a Class of Discrete Event Processes
• The complexity of ergodic mean-payoff games
• Theory of games and economic behavior.

Cited in

(13)

• Comparison of algorithms for simple stochastic games
• Comparison of algorithms for simple stochastic games
• Termination criteria for solving concurrent safety and reachability games
• Optimal strategies in concurrent reachability games
• On the Complexity of Reachability in Parametric Markov Decision Processes
• scientific article; zbMATH DE number 7561608 (Why is no real title available?)
• scientific article; zbMATH DE number 7340147 (Why is no real title available?)
• The complexity of ergodic mean-payoff games
• Monomial strategies for concurrent reachability games and other stochastic games
• Concurrent reachability games
• How to win first-order safety games
• Strategy improvement for concurrent reachability and turn-based stochastic safety games
• Synthesising Succinct Strategies in Safety and Reachability Games

This page was built for publication:

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