On the public citation graph
Simple Regret Optimization in Online Planning for Markov Decision Processes
0 signed · 67 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11871842_29openalex-snapshot
Bandit Based Monte-Carlo Planning
inferredcites →https://doi.org/10.1007/978-3-031-01564-9openalex-snapshot
A Concise Introduction to Models and Methods for Automated Planning
inferredcites →https://doi.org/10.1007/978-3-540-87608-3_4openalex-snapshot
An Analysis of UCT in Multi-player Games
inferredcites →https://doi.org/10.1016/j.artint.2011.03.007openalex-snapshot
Monte-Carlo tree search and rapid action value estimation in computer Go
inferredcites →https://doi.org/10.1016/j.tcs.2010.12.059openalex-snapshot
Pure exploration in finitely-armed and continuous-armed bandits
inferredcites →https://doi.org/10.1023/a:1013689704352openalex-snapshot
Finite-time Analysis of the Multiarmed Bandit Problem
inferredcites →https://doi.org/10.1023/a:1017932429737openalex-snapshot
A Sparse Sampling Algorithm for Near-Optimal Planning in Large Markov Decision Processes
inferredcites →https://doi.org/10.1090/s0002-9904-1952-09620-8openalex-snapshot
Some aspects of the sequential design of experiments
inferredcites →https://doi.org/10.1109/tciaig.2012.2186810openalex-snapshot
A Survey of Monte Carlo Tree Search Methods
inferredcites →https://doi.org/10.1109/tnn.2004.842673openalex-snapshot
Reinforcement Learning: An Introduction
inferredcites →https://doi.org/10.1137/s0097539701398375openalex-snapshot
The Nonstochastic Multiarmed Bandit Problem
inferredcites →https://doi.org/10.1609/aaai.v24i1.7542openalex-snapshot
High-Quality Policies for the Canadian Traveler's Problem
inferredcites →https://doi.org/10.1609/aaai.v24i1.7689openalex-snapshot
Integrating Sample-Based Planning and Model-Based Reinforcement Learning
inferredcites →https://doi.org/10.1609/aaai.v26i1.8362openalex-snapshot
LRTDP Versus UCT for Online Probabilistic Planning
inferredcites →https://doi.org/10.1609/aaai.v26i1.8369openalex-snapshot
Action Selection for MDPs: Anytime AO* Versus UCT
inferredcites →https://doi.org/10.1609/aimag.v16i2.1136openalex-snapshot
Operational rationality through compilation of anytime algorithms
inferredcites →https://doi.org/10.1609/icaps.v19i1.13363openalex-snapshot
Lower Bounding Klondike Solitaire with Monte-Carlo Planning
inferredcites →https://doi.org/10.1609/icaps.v22i1.13518openalex-snapshot
PROST: Probabilistic Planning Based on UCT
inferredcites →https://doi.org/10.1609/icaps.v23i1.13557openalex-snapshot
Trial-Based Heuristic Tree Search for Finite Horizon MDPs
inferredcites →https://doi.org/10.1609/socs.v1i1.18154openalex-snapshot
High-Quality Policies for the Canadian Traveler's Problem
inferredcites →https://doi.org/10.1613/jair.4432openalex-snapshot
Simple Regret Optimization in Online Planning for Markov Decision Processes
inferredcites →https://doi.org/10.1613/jair.575openalex-snapshot
Decision-Theoretic Planning: Structural Assumptions and Computational Leverage
inferredcites →https://doi.org/10.2200/s00513ed1v01y201306aim022openalex-snapshot
A Concise Introduction to Models and Methods for Automated Planning
inferredcites →https://doi.org/10.48550/arxiv.1108.3711openalex-snapshot
Doing Better Than UCT: Rational Monte Carlo Sampling in Trees
inferredcites →https://doi.org/10.48550/arxiv.1207.5879openalex-snapshot
Selecting Computations: Theory and Applications
inferredcites →https://doi.org/10.48550/arxiv.1309.6828openalex-snapshot
Monte-Carlo Planning: Theoretically Fast Convergence Meets Practical Efficiency
inferredcites →https://doi.org/10.48550/arxiv.1408.2028openalex-snapshot
Bandit Algorithms for Tree Search
inferredcites →https://doi.org/10.48550/arxiv.1909.12104openalex-snapshot
Action Selection for MDPs: Anytime AO* vs. UCT
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-86585-5_8openalex-snapshot
Anytime Sequential Halving in Monte-Carlo Tree Search
inferred← citeshttps://doi.org/10.1007/978-3-319-14923-3_1openalex-snapshot
Minimizing Simple and Cumulative Regret in Monte-Carlo Tree Search
inferred← citeshttps://doi.org/10.1007/978-3-319-39402-2_2openalex-snapshot
Sequential Halving for Partially Observable Games
inferred← citeshttps://doi.org/10.1007/s10458-016-9355-3openalex-snapshot
Allocating training instances to learning agents for team formation
inferred← citeshttps://doi.org/10.1007/s10462-022-10228-yopenalex-snapshot
Monte Carlo Tree Search: a review of recent modifications and applications
inferred← citeshttps://doi.org/10.1007/s10489-018-1248-5openalex-snapshot
Posterior sampling for Monte Carlo planning under uncertainty
inferred← citeshttps://doi.org/10.1007/s10489-021-02387-2openalex-snapshot
Dominant strategy truthful, deterministic multi-armed bandit mechanisms with logarithmic regret for sponsored search auctions
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.06.034openalex-snapshot
Modification of improved upper confidence bounds for regulating exploration in Monte-Carlo tree search
inferred← citeshttps://doi.org/10.1108/fs-05-2021-0104openalex-snapshot
New forms of intellectual activity in globalized society
inferred← citeshttps://doi.org/10.1109/iros.2017.8206161openalex-snapshot
Active end-effector pose selection for tactile object recognition through Monte Carlo tree search
inferred← citeshttps://doi.org/10.1109/tciaig.2013.2291577openalex-snapshot
Real-Time Monte Carlo Tree Search in Ms Pac-Man
inferred← citeshttps://doi.org/10.1145/2717316openalex-snapshot
Online Planning for Large Markov Decision Processes with Hierarchical Decomposition
inferred← citeshttps://doi.org/10.1177/0278364918755924openalex-snapshot
Dec-MCTS: Decentralized planning for multi-robot active perception
inferred← citeshttps://doi.org/10.14778/3749646.3749660openalex-snapshot
Extensible and Robust Evaluation of Similarity Queries
inferred← citeshttps://doi.org/10.15083/00075275openalex-snapshot
Application of Simple Regret Bandit Algorithms on Monte-Carlo Tree Search
inferred← citeshttps://doi.org/10.1515/sem-2015-0034openalex-snapshot
Non-anthropogenic mind and complexes of cultural codes
inferred← citeshttps://doi.org/10.1609/aaai.v35i14.17468openalex-snapshot
Single Player Monte-Carlo Tree Search Based on the Plackett-Luce Model
inferred← citeshttps://doi.org/10.1609/icaps.v24i1.13616openalex-snapshot
Thompson Sampling Based Monte-Carlo Planning in POMDPs
inferred← citeshttps://doi.org/10.1609/icaps.v24i1.13631openalex-snapshot
On MABs and Separation of Concerns in Monte-Carlo Planning for MDPs
inferred← citeshttps://doi.org/10.1609/socs.v12i1.18595openalex-snapshot
Meta-Level Techniques for Planning, Search, and Scheduling
inferred← citeshttps://doi.org/10.1609/socs.v4i1.18299openalex-snapshot
To UCT, or not to UCT? (Position Paper)
inferred← citeshttps://doi.org/10.1613/jair.5306openalex-snapshot
Robots in Retirement Homes: Applying Off-the-Shelf Planning and Scheduling to a Team of Assistive Robots
inferred← citeshttps://doi.org/10.1613/jair.5398openalex-snapshot
Combinatorial Multi-armed Bandits for Real-Time Strategy Games
inferred← citeshttps://doi.org/10.1613/jair.5507openalex-snapshot
On Monte Carlo Tree Search and Reinforcement Learning
inferred← citeshttps://doi.org/10.26481/dis.20250604tpopenalex-snapshot
Monte-Carlo tree search is work in progress
inferred← citeshttps://doi.org/10.3233/978-1-61499-419-0-321openalex-snapshot
Monte-Carlo Tree Search: To MC or to DP?
inferred← citeshttps://doi.org/10.48550/arxiv.1309.6828openalex-snapshot
Monte-Carlo Planning: Theoretically Fast Convergence Meets Practical Efficiency
inferred← citeshttps://doi.org/10.48550/arxiv.1703.00632openalex-snapshot
A Dominant Strategy Truthful, Deterministic Multi-Armed Bandit Mechanism with Logarithmic Regret
inferred← citeshttps://doi.org/10.48550/arxiv.1710.04805openalex-snapshot
Combinatorial Multi-armed Bandits for Real-Time Strategy Games
inferred← citeshttps://doi.org/10.48550/arxiv.2006.08785openalex-snapshot
On Effective Parallelization of Monte Carlo Tree Search
inferred← citeshttps://doi.org/10.48550/arxiv.2007.06184openalex-snapshot
Efficient Planning in Large MDPs with Weak Linear Function Approximation
inferred← citeshttps://doi.org/10.48550/arxiv.2106.04715openalex-snapshot
Measurable Monte Carlo Search Error Bounds
inferred← citeshttps://doi.org/10.70675/be8afdb3zd53dz4900z8a5dzfb79ab926190openalex-snapshot
Safe and Efficient Reinforcement Learning for decision-making in Autonomous Driving
showing the first 34 of 35 · page through all 35
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.