scientific article; zbMATH DE number 7559480

DOI10.4230/LIPICS.CONCUR.2020.24MaRDI QIDQ5089289zbMATH OpenFDO

Authors Patricia Bouyer, Stéphane Le Roux, Youssouf Oualhadj, Mickael Randour, Pierre Vandenhove

Publication date 18 July 2022

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2020.24

zbMATH Keywords

finite-memory determinacyoptimal strategiestwo-player games on graphs

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• A course in game theory.
• Automata, logics, and infinite games. A guide to current research
• Average-energy games
• Borel determinacy
• Bounding Average-Energy Games
• CONCUR 2005 – Concurrency Theory
• Concurrent games and semi-random determinacy
• Deciding maxmin reachability in half-blind stochastic games
• Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
• Energy mean-payoff games
• Energy parity games
• Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions
• Extending finite-memory determinacy to multi-player games
• First-cycle games
• Fixed-dimensional energy games are in pseudo-polynomial time
• Generalized Parity Games
• Graph Games and Reactive Synthesis
• Half-Positional Determinacy of Infinite Games
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Infinite Runs in Weighted Timed Automata with Energy Constraints
• Infinite sequential Nash equilibrium
• Life is random, time is not: Markov decision processes with window objectives
• Looking at mean-payoff and total-payoff through windows
• Mathematical Foundations of Computer Science 2004
• Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
• Non-zero sum games for reactive synthesis
• Positional strategies for mean payoff games
• Pure Stationary Optimal Strategies in Markov Decision Processes
• Simple strategies in multi-objective MDPs
• The complexity of multi-mean-payoff and multi-energy games
• Trading bounds for memory in games with counters
• Window parity games: an alternative approach toward parity games with time bounds

Cited in

(8)

• scientific article; zbMATH DE number 3968395 (Why is no real title available?)
• CONCUR 2005 – Concurrency Theory
• Submixing and shift-invariant stochastic games
• Characterizing omega-regularity through finite-memory determinacy of games on infinite graphs
• Characterizing positionality in games of Infinite duration over infinite graphs
• Characterizing positionality in games of infinite duration over infinite graphs
• Positional \(\omega\)-regular languages
• Positional -regular languages

This page was built for publication:

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