Randomness for free

DOI10.1016/J.IC.2015.06.003zbMATH Open1333.91008OpenAlexW1526407086MaRDI QIDQ897644FDOQ897644

Authors: Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, 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

Recommendations

• Randomness for free
• Partial-observation stochastic games, how to win when belief fails
• Partial-observation stochastic games: how to win when belief fails
• A survey of partial-observation stochastic parity games
• Concurrent games and semi-random determinacy

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• Randomness for free
• Fair adversaries and randomization in two-player games
• Different strokes in randomised strategies: revisiting Kuhn's theorem under finite-memory assumptions
• Subgame optimal strategies in finite concurrent games with prefix-independent objectives

This page was built for publication: Randomness for free

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