Randomness for free

DOI10.1016/j.ic.2015.06.003zbMath1333.91008OpenAlexW1526407086MaRDI QIDQ897644

Laurent Doyen, Hugo Gimbert, Krishnendu Chatterjee, Thomas A. Henzinger

Publication date: 7 December 2015

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2015.06.003

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items

Subgame optimal strategies in finite concurrent games with prefix-independent objectives

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of two-player games of incomplete information
• Infinite games played on finite graphs
• The complexity of mean payoff games on graphs
• Fair simulation
• POMDPs under probabilistic semantics
• Deciding the Value 1 Problem for $\sharp$ -acyclic Partially Observable Markov Decision Processes
• What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives.
• Alternating-time temporal logic
• Supervisory Control of a Class of Discrete Event Processes
• The determinacy of Blackwell games
• Partial-Observation Stochastic Games
• Computer Science Logic
• Random Measurable Selections
• Algorithms for Omega-Regular Games with Imperfect Information
• On Decision Problems for Probabilistic Büchi Automata
• Solving Sequential Conditions by Finite-State Strategies
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science