scientific article; zbMATH DE number 6774219

DOI10.4230/LIPIcs.CONCUR.2015.297zbMath1376.91038arXiv1407.5030MaRDI QIDQ5357711

Thomas Brihaye, Axel Haddad, Benjamin Monmege, Gilles Geeraerts

Publication date: 12 September 2017

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

reachabilitygames on graphsvalue iterationquantitative games

Mathematics Subject Classification ID

Analysis of algorithms (68W40) 2-person games (91A05) Games involving graphs (91A43)

Related Items (6)

Extending finite-memory determinacy to multi-player games ⋮ Probabilistic causes in Markov chains ⋮ Unnamed Item ⋮ Optimal Reachability in Divergent Weighted Timed Games ⋮ Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games ⋮ Unnamed Item

This page was built for publication: