Infinite games

DOI10.1007/3-540-36387-4_2MaRDI QIDQ4412825zbMATH OpenOpenAlexFDO

Authors René Mazala

Publication date 16 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-36387-4_2

Mathematics Subject Classification ID

Determinacy principles (03E60) Formal languages and automata (68Q45) 2-person games (91A05) Games involving graphs (91A43)

Recommendations

• Infinite games played on finite graphs
• On values of games
• Memoryless determinacy of parity games
• Definability in games
• Infinite games on finitely coloured graphs with applications to automata on infinite trees

Cited in

(34)

• The treewidth of proofs
• Decoy allocation games on graphs with temporal logic objectives
• A note on the Nash equilibria of some multi-player reachability/safety games
• Some game-theoretic remarks on two-player generalized cops and robbers games
• NP reasoning in the monotone \(\mu\)-calculus
• Linear temporal logic -- from infinite to finite horizon
• Planning for potential: efficient safe reinforcement learning
• A survey on the relationship between the game of cops and robbers and other game representations
• Selfish cops and active robber: multi-player pursuit evasion on graphs
• Games for query inseparability of description logic knowledge bases
• Playing infinite games in finite time.
• Inseparability and conservative extensions of description logic ontologies: a survey
• Simultaneously moving cops and robbers
• Knowledge base exchange: the case of OWL 2 QL
• ATL with Strategy Contexts and Bounded Memory
• Computing Weakest Strategies for Safety Games of Imperfect Information
• Excess games
• Weaves
• Memoryless determinacy of parity games
• Refinement modal logic
• Cops and Robbers on Dynamic Graphs: Offline and Online Case
• On values of games
• Selfish cops and passive robber: qualitative games
• The Simplest Unlimited-Player Game of Skill
• Simulation relations and applications in formal methods
• Realizability problem for constraint LTL
• Totality in arena games
• Arena-independent memory bounds for Nash equilibria in reachability games
• Arena-independent memory bounds for Nash equilibria in reachability games
• TSO games -- on the decidability of safety games under the total store order semantics
• Reachability and safety games under TSO semantics
• TSO games -- on the decidability of safety games under the total store order semantics
• Traces via strategies in two-player games
• Sufficient conditions for reachability in automata networks with priorities

This page was built for publication: Infinite games

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