scientific article

zbMath1483.91049arXiv1709.02099MaRDI QIDQ3384167

Fabio Mogavero, Daniele Dell'Erba, Massimo Benerecetti

Publication date: 14 December 2021

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

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

Mathematics Subject Classification ID

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

Related Items (4)

Robust worst cases for parity games algorithms ⋮ Unnamed Item ⋮ A delayed promotion policy for parity games ⋮ Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• Strategy logic
• Positional strategies for mean payoff games
• Borel determinacy
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Infinite games played on finite graphs
• The complexity of mean payoff games on graphs
• Fixed-point logics and solitaire games
• Automata, logics, and infinite games. A guide to current research
• Generalized Mean-payoff and Energy Games
• What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic
• Reasoning About Strategies
• Recursive algorithm for parity games requires exponential time
• A Deterministic Subexponential Algorithm for Solving Parity Games
• Alternating-time temporal logic
• Cyclic games and an algorithm to find minimax cycle means in directed graphs
• ATL* Satisfiability Is 2EXPTIME-Complete
• A deterministic subexponential algorithm for solving parity games
• Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus
• Solving Parity Games in Practice
• Solving Parity Games via Priority Promotion
• Deciding parity games in quasipolynomial time
• Benchmark Graphs for Practical Graph Isomorphism
• Substructure Temporal Logic
• Graph isomorphism in quasipolynomial time [extended abstract]
• Solving Parity Games in Big Steps
• On model checking for the \(\mu\)-calculus and its fragments
• Alternating tree automata, parity games, and modal \(\mu\)-calculus

This page was built for publication: