A CSP-Based Approach for Solving Parity Game

DOI10.1007/978-3-540-69311-6_16MaRDI QIDQ3507327zbMATH OpenOpenAlexFDO

Authors Min Jiang, Guoqing Wu, Chang-Le Zhou, Fan Zhang

Publication date 19 June 2008

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69311-6_16

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Applications of game theory (91A80)

Recommendations

• Algorithms for solving parity games
• A recursive approach to solving parity games in quasipolynomial time
• Solving parity games using an automata-based algorithm
• Solving parity games in practice
• A Deterministic Subexponential Algorithm for Solving Parity Games
• Solving parity games by a reduction to SAT
• Parameterized Algorithms for Parity Games
• A Multi-Core Solver for Parity Games

Cites work

• A deterministic subexponential algorithm for solving parity games
• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• Fundamentals of Computation Theory
• How easy is local search?
• scientific article; zbMATH DE number 1962853 (Why is no real title available?)
• scientific article; zbMATH DE number 1500523 (Why is no real title available?)
• Non-cooperative games
• On Nonterminating Stochastic Games
• On the complexity of the parity argument and other inefficient proofs of existence
• On total functions, existence theorems and computational complexity
• The complexity of stochastic games
• The NP-completeness column: finding needles in haystacks

Cited in

(3)

• Solving parity games by a reduction to SAT
• A Game Semantics of Idealized CSP
• A Multi-Core Solver for Parity Games

This page was built for publication: A CSP-Based Approach for Solving Parity Game

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