Looking at mean payoff through foggy windows

DOI10.1007/s00236-017-0304-7zbMath1408.91045OpenAlexW2941184861MaRDI QIDQ1629743

Paul Hunter, Guillermo A. Pérez, Jean-François Raskin

Publication date: 12 December 2018

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-017-0304-7

zbMATH Keywords

verificationsynthesisgame theorypartial observationquantitative games

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Unnamed Item, Unnamed Item, Timed games with bounded window parity objectives

Uses Software

• Alpaga
• Acacia+

Cites Work

• Unnamed Item
• Faster algorithms for mean-payoff games
• The complexity of two-player games of incomplete information
• Positional strategies for mean payoff games
• The complexity of mean payoff games on graphs
• Memoryless determinacy of parity and mean payoff games: a simple proof
• A note on the approximation of mean-payoff games
• What’s Decidable about Weighted Automata?
• Antichain Algorithms for Finite Automata
• Energy and Mean-Payoff Games with Imperfect Information
• Algorithms for Omega-Regular Games with Imperfect Information
• Antichains for the Automata-Based Approach to Model-Checking
• On the synthesis of strategies in infinite games
• The Complexity of Partial-Observation Parity Games
• Looking at Mean-Payoff and Total-Payoff through Windows
• STACS 2004
• From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata