scientific article; zbMATH DE number 7204389

DOI10.4230/LIPICS.MFCS.2017.55zbMATH Open1447.91018MaRDI QIDQ5111270FDOQ5111270

Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Krishnendu Chatterjee

Publication date: 26 May 2020

Title of this publication is not available (Why is that?)

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

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)

Cites Work

• Stochastic Games
• Theory of games and economic behavior.
• Title not available (Why is that?)
• Alternating-time temporal logic
• Title not available (Why is that?)
• On equilibria in repeated games with absorbing states
• Concurrent reachability games
• Supervisory Control of a Class of Discrete Event Processes
• Title not available (Why is that?)
• Existence of p-Equilibrium and Optimal Stationary Strategies in Stochastic Games
• Title not available (Why is that?)
• Computing uniformly optimal strategies in two-player stochastic games
• Solving Simple Stochastic Games with Few Coin Toss Positions
• Discounted and positive stochastic games
• Recursive Concurrent Stochastic Games
• Concurrent games with tail objectives
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Complexity of Ergodic Mean-payoff Games
• Qualitative concurrent parity games
• Fictitious play applied to sequences of games and discounted stochastic games
• The complexity of solving reachability games using value and strategy iteration

Cited In (7)

• Comparison of algorithms for simple stochastic games
• On the Complexity of Reachability in Parametric Markov Decision Processes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• How to win first-order 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)