Faster algorithms for mean-payoff parity games

DOI10.4230/LIPICS.MFCS.2017.39MaRDI QIDQ5111253zbMATH OpenFDO

Authors Krishnendu Chatterjee, Alexander Svozil, Monika R. Henzinger

Publication date 26 May 2020

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

zbMATH Keywords

Büchi gamesgraph gamesmean-payoff parity

Mathematics Subject Classification ID

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

Recommendations

• Perfect-information stochastic mean-payoff parity games
• Faster algorithms for mean-payoff games
• A pseudo-quasi-polynomial algorithm for mean-payoff parity games
• Improved set-based symbolic algorithms for parity games
• Qualitative analysis of concurrent mean-payoff games

Cites work

• Better Quality in Synthesis through Quantitative Objectives
• Energy and Mean-Payoff Parity Markov Decision Processes
• Energy parity games
• Faster algorithms for mean-payoff games
• scientific article; zbMATH DE number 4124989 (Why is no real title available?)
• Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games
• Infinite Runs in Weighted Timed Automata with Energy Constraints
• Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited
• Perfect-information stochastic mean-payoff parity games
• Positional strategies for mean payoff games
• Solving Sequential Conditions by Finite-State Strategies
• Supervisory Control of a Class of Discrete Event Processes
• Synthesizing robust systems

Cited in

(14)

• On satisficing in quantitative games
• Faster algorithms for extensive-form game solving via improved smoothing functions
• On promptness in parity games
• Improved Rounding for Parallel Repeated Unique Games
• Stability in graphs and games
• Improved set-based symbolic algorithms for parity games
• A pseudo-quasi-polynomial algorithm for mean-payoff parity games
• Solving mean-payoff games via quasi dominions
• The cost of exactness in quantitative reachability
• Improved algorithms for parity and Streett objectives
• Faster algorithms for mean-payoff games
• Perfect-information stochastic mean-payoff parity games
• Fine-grained complexity lower bounds for problems in computer aided verification
• New algorithms for combinations of objectives using separating automata

This page was built for publication: Faster algorithms for mean-payoff parity games

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