#

sequential-decisions

Here are 3 public repositories matching this topic...

masouduut94 / MCTS-agent-python

Monte Carlo Tree Search (MCTS) is a method for finding optimal decisions in a given domain by taking random samples in the decision space and building a search tree accordingly. It has already had a profound impact on Artificial Intelligence (AI) approaches for domains that can be represented as trees of sequential decisions, particularly games …

reinforcement-learning mcts markov-decision-processes monte-carlo-tree-search sequential-decisions decision-space game-of-hex

Updated Mar 10, 2024
Python

sisl / SCoBA.jl

Stochastic Conflict-Based Allocation

task-allocation multiagent-planning conflict-based-search sequential-decisions

Updated Oct 7, 2020
Julia

duongnhatthang / meta-bandit

Non-stationary Bandits and Meta-Learning with a Small Set of Optimal Arms

python3 multi-task bandit meta-learning partial-monitoring sequential-decision-making-problems bandit-algorithms sequential-decisions meta-bandit

Updated Sep 27, 2024
Python

Improve this page

Add a description, image, and links to the sequential-decisions topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the sequential-decisions topic, visit your repo's landing page and select "manage topics."