Optimistic Monte Carlo tree search with sampled information relaxation dual bounds
Year of publication: |
2020
|
---|---|
Authors: | Jiang, Daniel R. ; Al-Kanj, Lina ; Powell, Warren B. |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 68.2020, 6, p. 1678-1697
|
Subject: | Monte Carlo tree search | dynamic programming | information relaxation | Monte-Carlo-Simulation | Monte Carlo simulation | Dynamische Optimierung | Dynamic programming | Mathematische Optimierung | Mathematical programming | Suchtheorie | Search theory |
-
Information relaxation and a duality-driven algorithm for stochastic dynamic programs
Chen, Nan, (2024)
-
Matching and scheduling of student-company-talks for a university IT-speed dating event
Ackermann, Christian, (2022)
-
Optimising darts strategy using Markov decision processes and reinforcement learning
Baird, Graham, (2020)
- More ...
-
Al-Kanj, Lina, (2020)
-
An approximate dynamic programming algorithm for monotone value functions
Jiang, Daniel R., (2015)
-
Jiang, Daniel R., (2015)
- More ...