Admissible Strategies in Infinite Games over Graphs

DOI10.1007/978-3-642-03816-7_27MaRDI QIDQ3182935zbMATH OpenOpenAlexFDO

Authors Marco Faella

Publication date 16 October 2009

Published in Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03816-7_27

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Games involving graphs (91A43)

Recommendations

• Admissibility in Infinite Games
• Infinite games played on finite graphs
• On the synthesis of strategies in infinite games
• Infinite Games on Finite Graphs Using Grossone
• Infinite games on finite graphs using grossone
• A constraint-based approach to solving games on infinite graphs
• scientific article; zbMATH DE number 6862070
• Computer Aided Verification
• Infinite Deterministic Graphical Games
• Strategically stable equilibria in games with infinitely many pure strategies

Cites work

• A course in game theory.
• Admissibility in Infinite Games
• Alternating-time temporal logic
• Code aware resource management
• CONCUR 2005 – Concurrency Theory
• scientific article; zbMATH DE number 4124989 (Why is no real title available?)
• scientific article; zbMATH DE number 2080757 (Why is no real title available?)
• scientific article; zbMATH DE number 1864595 (Why is no real title available?)
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• On the synthesis of strategies in infinite games

Cited in

(21)

• Shield synthesis
• A game-theoretic approach for the synthesis of complex systems
• Synthesizing adaptive test strategies from temporal logic specifications
• Structured strategies in games on graphs
• Measuring Permissivity in Finite Games
• Obliging games
• On the synthesis of strategies in infinite games
• The complexity of admissibility in omega-regular games
• scientific article; zbMATH DE number 6862070 (Why is no real title available?)
• Permissive strategies: from parity games to safety games
• Beyond admissibility: dominance between chains of strategies
• Admissiblity in concurrent games
• Assume-admissible synthesis
• Admissible strategies in timed games
• Computer Science Logic
• Computer Aided Verification
• With a little help from your friends: semi-cooperative games via joker moves
• Characterizing positionality in games of Infinite duration over infinite graphs
• Characterizing positionality in games of infinite duration over infinite graphs
• With a little help from your friends: semi-cooperative games via joker moves
• \( \textsc{ltl}_f\) synthesis under environment specifications for reachability and safety properties

This page was built for publication: Admissible Strategies in Infinite Games over Graphs

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