scientific article; zbMATH DE number 7378573

DOI10.4230/LIPIcs.CONCUR.2018.29MaRDI QIDQ5009445

Véronique Bruyère, Quentin Hautem, Jean-François Raskin

Publication date: 4 August 2021

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

parameterized complexityordered objectives\(\omega\)-regular objectivestwo-player zero-sum games played on graphs

Mathematics Subject Classification ID

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

Related Items (3)

Deciding Parity Games in Quasi-polynomial Time ⋮ Unnamed Item ⋮ Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives

Cites Work

• Unnamed Item
• Synthesis with rational environments
• Borel determinacy
• The complexity of mean payoff games on graphs
• Latticed-LTL synthesis in the presence of noisy inputs
• The complexity of multi-mean-payoff and multi-energy games
• Concurrent Games with Ordered Objectives
• Explicit Muller Games are PTIME
• Ranking Automata and Games for Prioritized Requirements
• Better Quality in Synthesis through Quantitative Objectives
• Conditionally Optimal Algorithms for Generalized B\"uchi Games
• On the complexity of heterogeneous multidimensional quantitative games
• Secure equilibria in weighted games
• Deciding parity games in quasipolynomial time
• Mathematical Foundations of Computer Science 2005
• Generalized Parity Games
• CONCUR 2003 - Concurrency Theory

This page was built for publication: