scientific article; zbMATH DE number 7438575

zbMath1476.68319arXiv1509.07207MaRDI QIDQ5013885

Maciej Gazda, Tim A. C. Willemse

Publication date: 3 December 2021

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Games involving graphs (91A43)

Uses Software

• PGSolver

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Faster algorithms for mean-payoff games
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Infinite games played on finite graphs
• Games for synthesis of controllers with partial observation.
• Automata, logics, and infinite games. A guide to current research
• Non-oblivious Strategy Improvement
• Recursive algorithm for parity games requires exponential time
• Symmetric Strategy Improvement
• An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
• A deterministic subexponential algorithm for solving parity games
• Solving Parity Games in Practice
• Algorithms for Parity Games
• Solving Parity Games in Big Steps

This page was built for publication: