Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited
From MaRDI portal
Publication:3172910
DOI10.1007/978-3-642-24372-1_11zbMath1348.68093arXiv1102.3615OpenAlexW1887826286MaRDI QIDQ3172910
Nicolas Markey, Patricia Bouyer, J. Olschewski, Michael Ummels
Publication date: 7 October 2011
Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1102.3615
Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80) Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55)
Related Items (11)
Equilibrium in two-player stochastic games with shift-invariant payoffs ⋮ Poster Abstract: Permissiveness for Strategy Adaptation ⋮ Unnamed Item ⋮ Down the Borel hierarchy: solving Muller games via safety games ⋮ Strategy synthesis for multi-dimensional quantitative objectives ⋮ Energy parity games ⋮ Quantitative reductions and vertex-ranked infinite games ⋮ Synthesizing permissive winning strategy templates for parity games ⋮ Unnamed Item ⋮ A logic with revocable and refinable strategies ⋮ Compositional construction of most general controllers
This page was built for publication: Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited
