Quantitative reductions and vertex-ranked infinite games
From MaRDI portal
Publication:2029603
DOI10.1016/J.IC.2020.104596zbMATH Open1501.91040OpenAlexW3035121682MaRDI QIDQ2029603FDOQ2029603
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
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Spaces of games (91A70) Algorithmic game theory and complexity (91A68)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of mean payoff games on graphs
- Borel determinacy
- Positional strategies for mean payoff games
- Synthesizing robust systems
- Better Quality in Synthesis through Quantitative Objectives
- Generalized mean-payoff and energy games
- From liveness to promptness
- Energy parity games
- Finitary winning in ω-regular games
- Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications
- Playing infinite games in finite time.
- Playing Muller games in a hurry
- Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited
- Down the Borel hierarchy: solving Muller games via safety games
- Faster algorithms for mean-payoff games
- Parametric linear dynamic logic
- The complexity of multi-mean-payoff and multi-energy games
- Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
- McNaughton games and extracting strategies for concurrent programs
- Parity and Streett Games with Costs
- The Complexity of Request-Response Games
- Synthesizing Optimally Resilient Controllers
Cited In (1)
This page was built for publication: Quantitative reductions and vertex-ranked infinite games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2029603)
