scientific article; zbMATH DE number 7559496

DOI10.4230/LIPICS.CONCUR.2020.40MaRDI QIDQ5089307zbMATH OpenFDO

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

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

• scientific article; zbMATH DE number 5954365 (Why is no real title available?)
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• A sparse sampling algorithm for near-optimal planning in large Markov decision processes
• Finite-time analysis of the multiarmed bandit problem
• Learning-based mean-payoff optimization in an unknown MDP under omega-regular constraints
• Linear Encodings of Bounded LTL Model Checking
• Probability Inequalities for Sums of Bounded Random Variables
• Propositional SAT solving
• Verification of Markov decision processes using learning algorithms

Cited in

(2)

• Safe learning for near-optimal scheduling
• scientific article; zbMATH DE number 7233958 (Why is no real title available?)

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)