scientific article; zbMATH DE number 7559496

DOI10.4230/LIPIcs.CONCUR.2020.40MaRDI QIDQ5089307

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

Publication date: 18 July 2022

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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)

Related Items (1)

Safe learning for near-optimal scheduling

Cites Work

• A sparse sampling algorithm for near-optimal planning in large Markov decision processes
• Faster statistical model checking for unbounded temporal properties
• Propositional SAT Solving
• Verification of Markov Decision Processes Using Learning Algorithms
• 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
• Finite-time analysis of the multiarmed bandit problem
• Unnamed Item
• Unnamed Item

This page was built for publication: