Solving odd-fair parity games

DOI10.4230/LIPICS.FSTTCS.2023.34MaRDI QIDQ6951699zbMATH OpenFDO

Authors Irmak Sağlam, Anne-Kathrin Schmuck

Publication date 28 July 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2023.34

zbMATH Keywords

algorithmic game theoryparity gamesstrong transition fairness

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cites work

• A quasi-polynomial black-box algorithm for fixed point evaluation
• An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
• Attracting tangles to solve parity games
• Augmented finite transition systems as abstractions for control synthesis
• Borel determinacy
• Code aware resource management
• Control of -automata under state fairness assumptions
• Fairness and related properties in transition systems - a temporal logic to deal with fairness
• Fast symbolic algorithms for omega-regular games under strong transition fairness
• Formal methods for discrete-time dynamical systems
• Fully observable non-deterministic planning as assumption-based reactive synthesis
• scientific article; zbMATH DE number 4179361 (Why is no real title available?)
• scientific article; zbMATH DE number 3887063 (Why is no real title available?)
• scientific article; zbMATH DE number 3972158 (Why is no real title available?)
• scientific article; zbMATH DE number 1500523 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Memoryless Determinacy of Parity Games
• Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time
• Progress measures, immediate determinacy, and a subset construction for tree automata
• Quasipolynomial computation of nested fixpoints
• Results on the propositional \(\mu\)-calculus
• Solving odd-fair parity games
• Synthesis of Reactive(1) designs
• Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games
• The Complexity of Tree Automata and Logics of Programs
• Universal algorithms for parity games and nested fixpoints
• Verification and Control of Hybrid Systems
• Weak, strong, and strong cyclic planning via symbolic model checking

Cited in

(2)

• Fair quantitative games
• Solving odd-fair parity games

This page was built for publication: Solving odd-fair parity games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6951699)