scientific article; zbMATH DE number 7559496

DOI10.4230/LIPICS.CONCUR.2020.40MaRDI QIDQ5089307FDOQ5089307

Authors: Damien Busatto-Gaston, Debraj Chakraborty, Jean-François Raskin 

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/2006.04712

Title of this publication is not available (Why is that?)

zbMATH Keywords

simulationMarkov decision processMonte Carlo tree searchsymbolic advice

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Title not available (Why is that?)
• Probability Inequalities for Sums of Bounded Random Variables
• Finite-time analysis of the multiarmed bandit problem
• Linear Encodings of Bounded LTL Model Checking
• A sparse sampling algorithm for near-optimal planning in large Markov decision processes
• Title not available (Why is that?)
• Propositional SAT solving
• Verification of Markov decision processes using learning algorithms
• Learning-based mean-payoff optimization in an unknown MDP under omega-regular constraints
• Faster statistical model checking for unbounded temporal properties

Cited In (2)

• Safe learning for near-optimal scheduling
• Title not available (Why is that?)

This page was built for publication:

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