Amanote Research
Register
Sign In
A Pseudo-Quasi-Polynomial Algorithm for Mean-Payoff Parity Games
doi 10.1145/3209108.3209162
Full Text
Open PDF
Abstract
Available in
full text
Date
July 9, 2018
Authors
Laure Daviaud
Martin Jurdziński
Ranko Lazić
Publisher
ACM
Related search
Mean-Payoff Parity Games
Perfect-Information Stochastic Mean-Payoff Parity Games
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Memoryless Determinacy of Parity and Mean Payoff Games: A Simple Proof
Theoretical Computer Science
Computer Science
Theoretical Computer Science
Mean-Payoff Games and Propositional Proofs
Information and Computation
Theoretical Computer Science
Computational Theory
Computer Science Applications
Information Systems
Mathematics
A Polynomial Time Algorithm for Spatio-Temporal Security Games
Approximation Schemes for Stochastic Mean Payoff Games With Perfect Information and Few Random Positions
Algorithmica
Applied Mathematics
Computer Science Applications
Computer Science
An Efficient Implementation of a Quasi-Polynomial Algorithm for Generating Hypergraph Transversals
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Algorithms for Stochastic Parity Games
Payoff Information and Learning in Signaling Games
Games and Economic Behavior
Economics
Econometrics
Finance
