Optimistic Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds (Q5144789): Difference between revisions

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

Latest revision as of 09:24, 24 July 2024

scientific article; zbMATH DE number 7298144
Language Label Description Also known as
English
Optimistic Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds
scientific article; zbMATH DE number 7298144

    Statements

    Optimistic Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds (English)
    0 references
    0 references
    0 references
    0 references
    19 January 2021
    0 references
    0 references
    Monte Carlo tree search
    0 references
    dynamic programming
    0 references
    information relaxation
    0 references
    0 references
    0 references