A GENERAL NOTION OF UNIFORM STRATEGIES

DOI10.1142/S0219198914400040zbMath1293.91030OpenAlexW2168387088MaRDI QIDQ5406294

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

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

Related Items

Observation and distinction: representing information in infinite games, DEL-based epistemic planning: decidability and complexity, Uniform strategies, rational relations and jumping automata, Time-aware uniformization of winning strategies

Cites Work

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