Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions

DOI10.4230/LIPICS.FSTTCS.2018.38OpenAlexW2963055215MaRDI QIDQ5090979FDOQ5090979

Authors: Stéphane Le Roux, Arno Pauly, Mickael Randour 

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1808.05791

Recommendations

• Extending finite-memory determinacy to multi-player games
• Finite-memory strategies in two-player infinite games
• Finitary winning in \({\omega}\)-regular games
• Tools and Algorithms for the Construction and Analysis of Systems
• Games where you can play optimally with arena-independent finite memory

zbMATH Keywords

games on graphsmultiple objectivesfinite-memory determinacy

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cites Work

• Borel determinacy
• Automata, logics, and infinite games. A guide to current research
• Positional strategies for mean payoff games
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Fixed-dimensional energy games are in pseudo-polynomial time
• Infinite Runs in Weighted Timed Automata with Energy Constraints
• Energy parity games
• Computer Science Logic
• Generalized Parity Games
• Mathematical Foundations of Computer Science 2004
• The complexity of multi-mean-payoff and multi-energy games
• Looking at mean-payoff and total-payoff through windows
• Robust multidimensional mean-payoff games are undecidable
• Half-Positional Determinacy of Infinite Games
• CONCUR 2005 – Concurrency Theory
• Graph Games and Reactive Synthesis
• On the complexity of heterogeneous multidimensional games
• Extending finite-memory determinacy to multi-player games
• Average-energy games
• Bounding Average-Energy Games
• Non-zero sum games for reactive synthesis
• Window parity games: an alternative approach toward parity games with time bounds

Cited In (10)

• Title not available (Why is that?)
• Characterizing positionality in games of Infinite duration over infinite graphs
• Timed games with bounded window parity objectives
• Games where you can play optimally with arena-independent finite memory
• Half-positional objectives recognized by deterministic Büchi automata
• Synthesis for multi-weighted games with branching-time winning conditions
• Different strokes in randomised strategies: revisiting Kuhn's theorem under finite-memory assumptions
• Characterizing positionality in games of infinite duration over infinite graphs
• Title not available (Why is that?)
• Characterizing omega-regularity through finite-memory determinacy of games on infinite graphs

This page was built for publication: Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090979)