Non-zero sum games for reactive synthesis

DOI10.1007/978-3-319-30000-9_1MaRDI QIDQ2798706zbMATH OpenOpenAlexFDO

Authors Romain Brenguier, Lorenzo Clemente, Paul Hunter, G. A. Pérez, Mickael Randour, Ocan Sankur, Mathieu Sassolas, Jean-François Raskin

Publication date 13 April 2016

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Graph theory (including graph drawing) in computer science (68R10) Games involving graphs (91A43)

Abstract: In this invited contribution, we summarize new solution concepts useful for the synthesis of reactive systems that we have introduced in several recent publications. These solution concepts are developed in the context of non-zero sum games played on graphs. They are part of the contributions obtained in the inVEST project funded by the European Research Council.

Recommendations

• Graph Games and Reactive Synthesis
• On the synthesis of strategies in infinite games
• Computer aided synthesis: a game-theoretic approach
• Solving Games Without Determinization
• The complexity of rational synthesis for concurrent games

Cited in

(24)

• Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives
• A game-theoretic approach for the synthesis of complex systems
• On the existence of weak subgame perfect equilibria
• Computer aided synthesis: a game-theoretic approach
• Quantitative vs. weighted automata
• On the existence of weak subgame perfect equilibria
• Graph Games and Reactive Synthesis
• Constrained existence problem for weak subgame perfect equilibria with -regular Boolean objectives
• Beyond admissibility: dominance between chains of strategies
• scientific article; zbMATH DE number 7559480 (Why is no real title available?)
• Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions
• Infinite-duration bidding games
• scientific article; zbMATH DE number 7649921 (Why is no real title available?)
• On the comparison of discounted-sum automata with multiple discount factors
• Stackelberg-Pareto synthesis
• With a little help from your friends: semi-cooperative games via joker moves
• Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete
• Different strokes in randomised strategies: revisiting Kuhn's theorem under finite-memory assumptions
• The adversarial Stackelberg value in quantitative games
• A game of pawns
• A game of pawns
• With a little help from your friends: semi-cooperative games via joker moves
• Games with -automatic preference relations
• The non-cooperative rational synthesis problem for SPEs and -regular objectives

This page was built for publication: Non-zero sum games for reactive synthesis

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