Mathematical Foundations of Computer Science 2004

DOI10.1007/b99679zbMath1097.91022OpenAlexW2488008928MaRDI QIDQ5311141

Hugo Gimbert, Wiesław Zielonka

Publication date: 22 August 2005

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

Full work available at URL: https://doi.org/10.1007/b99679

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43)

Related Items (15)

Average-energy games ⋮ Continuous Positional Payoffs ⋮ Computing Game Values for Crash Games ⋮ Submixing and shift-invariant stochastic games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Exploiting Game Theory for Analysing Justifications ⋮ Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games ⋮ A nested family of \(k\)-total effective rewards for positional games ⋮ Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games ⋮ Unnamed Item ⋮ Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions ⋮ Looking at mean-payoff and total-payoff through windows

This page was built for publication: Mathematical Foundations of Computer Science 2004