Energy parity games

DOI10.1016/j.tcs.2012.07.038zbMath1260.91039OpenAlexW2096608485WikidataQ41640966 ScholiaQ41640966MaRDI QIDQ1758152

Krishnendu Chatterjee, Laurent Doyen

Publication date: 8 November 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.07.038

zbMATH Keywords

games on graphsparity objectivesquantitative objectives

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (35)

Equilibria for games with combined qualitative and quantitative objectives ⋮ Graph Games and Reactive Synthesis ⋮ Extending finite-memory determinacy to multi-player games ⋮ Unnamed Item ⋮ Ratio and Weight Quantiles ⋮ Temporal Specifications with Accumulative Values ⋮ Reachability games with relaxed energy constraints ⋮ Bounded repairability of word languages ⋮ Quantitative controller synthesis for consumption Markov decision processes ⋮ Playing Safe, Ten Years Later ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Energy Büchi problems ⋮ Unnamed Item ⋮ Hierarchical cost-parity games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Bounding Average-Energy Games ⋮ Unnamed Item ⋮ Simple stochastic games with almost-sure energy-parity objectives are in NP and conp ⋮ Strategic reasoning with a bounded number of resources: the quest for tractability ⋮ Solving parity games via priority promotion ⋮ First-cycle games ⋮ Probabilistic Model Checking for Energy-Utility Analysis ⋮ On decidability and complexity of low-dimensional robot games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Quantitative reductions and vertex-ranked infinite games ⋮ Quasipolynomial computation of nested fixpoints ⋮ Synthesizing Optimally Resilient Controllers ⋮ Synthesizing optimally resilient controllers ⋮ Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions

Cites Work

• Unnamed Item
• Faster algorithms for mean-payoff games
• The complexity of stochastic games
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Infinite games played on finite graphs
• The complexity of mean payoff games on graphs
• Automata, logics, and infinite games. A guide to current research
• Memoryless determinacy of parity and mean payoff games: a simple proof
• Faster Algorithm for Mean-Payoff Games
• Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited
• Infinite Runs in Weighted Timed Automata with Energy Constraints
• Half-Positional Determinacy of Infinite Games
• Better Quality in Synthesis through Quantitative Objectives
• Supervisory Control of a Class of Discrete Event Processes
• Solving Sequential Conditions by Finite-State Strategies
• Stochastic Games
• CONCUR 2005 – Concurrency Theory
• Foundations of Software Science and Computation Structures
• On model checking for the \(\mu\)-calculus and its fragments

This page was built for publication: Energy parity games