Looking at mean-payoff and total-payoff through windows
From MaRDI portal
Publication:2346404
DOI10.1016/j.ic.2015.03.010zbMath1317.68065OpenAlexW1902461641MaRDI QIDQ2346404
Mickael Randour, Laurent Doyen, Krishnendu Chatterjee, Jean-François Raskin
Publication date: 1 June 2015
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2015.03.010
Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05) Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (15)
Average-energy games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Bounding Average-Energy Games ⋮ Percentile queries in multi-dimensional Markov decision processes ⋮ Unnamed Item ⋮ Combinations of Qualitative Winning for Stochastic Parity Games ⋮ Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games ⋮ Unnamed Item ⋮ Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions ⋮ Unnamed Item ⋮ Timed games with bounded window parity objectives
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Polynomial-time algorithms for energy games with special weight structures
- Faster algorithms for mean-payoff games
- Cyclical games with prohibitions
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
- From liveness to promptness
- Positional strategies for mean payoff games
- Borel determinacy
- A characterization of the minimum cycle mean in a digraph
- The complexity of mean payoff games on graphs
- Verifying lossy channel systems has nonprimitive recursive complexity.
- Strategy synthesis for multi-dimensional quantitative objectives
- Approximating the minimum cycle mean
- Mean Cost Cyclical Games
- Generalized Mean-payoff and Energy Games
- Finitary winning in ω-regular games
- Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games
- Church Synthesis Problem for Noisy Input
- Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition
- Cyclic games and an algorithm to find minimax cycle means in directed graphs
- Model Checking Probabilistic Timed Automata with One or Two Clocks
- Games through Nested Fixpoints
- Alternation
- Looking at Mean-Payoff and Total-Payoff through Windows
- Mathematical Foundations of Computer Science 2004
- Synthesis from LTL Specifications with Mean-Payoff Objectives
- Stochastic Games with Perfect Information and Time Average Payoff
- Tools and Algorithms for the Construction and Analysis of Systems
This page was built for publication: Looking at mean-payoff and total-payoff through windows
