A general notion of uniform strategies

DOI10.1142/S0219198914400040MaRDI QIDQ5406294zbMATH OpenOpenAlexFDO

Authors Bastien Maubert, Sophie Pinchinat

Publication date 1 April 2014

Published in International Game Theory Review (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0219198914400040

zbMATH Keywords

game theoryrational relationsuniform strategies

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) 2-person games (91A05) Games in extensive form (91A18) Decision theory for games (91A35) Games involving topology, set theory, or logic (91A44)

Recommendations

• The complexity of synthesizing uniform strategies
• Uniform strategies, rational relations and jumping automata
• Jumping Automata for Uniform Strategies
• A backward-traversal-based approach for symbolic model checking of uniform strategies for constrained reachability
• On the synthesis of strategies in infinite games

Cites work

• A decidable class of problems for control under partial observation
• A model-theoretic analysis of knowledge
• Algorithms for Omega-Regular Games with Imperfect Information
• Alternating-time temporal logic
• Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications
• Deterministic generators and games for LTL fragments
• Diagnosability of discrete-event systems
• Games in dynamic-epistemic logic
• Model Checking on Trees with Path Equivalences
• On Relations Defined by Generalized Finite Automata
• The absent-minded driver's paradox: Synthesis and responses
• The complexity of propositional linear temporal logics
• The complexity of reasoning about knowledge and time. I: Lower bounds
• The complexity of two-player games of incomplete information
• Unforgettable Forgetful Determinacy
• Verification of concurrent programs: The automata-theoretic framework

Cited in

(6)

• Time-aware uniformization of winning strategies
• DEL-based epistemic planning: decidability and complexity
• Uniform strategies, rational relations and jumping automata
• Observation and distinction: representing information in infinite games
• The complexity of synthesizing uniform strategies
• On the optimality of the uniform random strategy

This page was built for publication: A general notion of uniform strategies

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