Half-Positional Determinacy of Infinite Games
From MaRDI portal
Publication:3591410
DOI10.1007/11787006_29zbMath1133.91334OpenAlexW1508088786MaRDI QIDQ3591410
Publication date: 11 September 2007
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11787006_29
Games involving graphs (91A43) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (19)
The Theory of Universal Graphs for Infinite Duration Games ⋮ Mean-payoff games with \(\omega\)-regular specifications ⋮ Average-energy games ⋮ Cooperative concurrent games ⋮ Subgame-perfect Equilibria in Mean-payoff Games (journal version) ⋮ Submixing and shift-invariant stochastic games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Exploring the boundary of half-positionality ⋮ Quantitative fair simulation games ⋮ First-cycle games ⋮ Energy parity games ⋮ Unnamed Item ⋮ On Memoryless Quantitative Objectives ⋮ Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions ⋮ Quantitatively fair scheduling ⋮ The complexity of multi-mean-payoff and multi-energy games
This page was built for publication: Half-Positional Determinacy of Infinite Games
