Quantitative reductions and vertex-ranked infinite games

DOI10.1016/j.ic.2020.104596zbMath1501.91040OpenAlexW3035121682MaRDI QIDQ2029603

Alexander Weinert

Publication date: 3 June 2021

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://elib.dlr.de/134511/1/infandcomp18.pdf

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Spaces of games (91A70) Algorithmic game theory and complexity (91A68)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Down the Borel hierarchy: solving Muller games via safety games
• Parametric linear dynamic logic
• Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
• Faster algorithms for mean-payoff games
• From liveness to promptness
• Positional strategies for mean payoff games
• Borel determinacy
• The complexity of mean payoff games on graphs
• Energy parity games
• McNaughton games and extracting strategies for concurrent programs
• Synthesizing robust systems
• The complexity of multi-mean-payoff and multi-energy games
• Generalized Mean-payoff and Energy Games
• PLAYING MULLER GAMES IN A HURRY
• Finitary winning in ω-regular games
• The Complexity of Request-Response Games
• Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited
• Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications
• Better Quality in Synthesis through Quantitative Objectives
• Synthesizing Optimally Resilient Controllers
• Parity and Streett Games with Costs

This page was built for publication: Quantitative reductions and vertex-ranked infinite games