Optimistic Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds

DOI10.1287/opre.2019.1939zbMath1457.90168arXiv1704.05963OpenAlexW3086574084MaRDI QIDQ5144789

Warren B. Powell, Daniel R. Jiang, Lina Al-Kanj

Publication date: 19 January 2021

Published in: Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

dynamic programmingMonte Carlo tree searchinformation relaxation

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• Unnamed Item
• An analysis of alpha-beta pruning
• Pricing American-style securities using simulation
• A comparison of Monte Carlo tree search and rolling horizon optimization for large-scale dynamic resource allocation problems
• Simple Policies for Dynamic Pricing with Imperfect Forecasts
• A Re-Solving Heuristic with Bounded Revenue Loss for Network Revenue Management with Customer Choice
• Information Relaxations, Duality, and Convex Stochastic Dynamic Programs
• Information Relaxations and Duality in Stochastic Dynamic Programs
• Valuation of Storage at a Liquefied Natural Gas Terminal
• An Optimal Approximate Dynamic Programming Algorithm for the Lagged Asset Acquisition Problem
• An Automatic Method of Solving Discrete Programming Problems
• Pricing American Options: A Duality Approach
• Monte Carlo valuation of American options
• An Adaptive Sampling Algorithm for Solving Markov Decision Processes
• Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
• Finite-time analysis of the multiarmed bandit problem

This page was built for publication: Optimistic Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds