sequential-decisions

There are 0 repository under sequential-decisions 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 and planning problems. In this project I used a board game called "HEX" as a platform to test different simulation strategies in MCTS field.
mcts sequential-decisions decision-space markov-decision-processes monte-carlo-tree-search game-of-hex reinforcement-learning
Language:Python 58
sisl / SCoBA.jl
Stochastic Conflict-Based Allocation
conflict-based-search multiagent-planning sequential-decisions task-allocation
Language:Julia 45
duongnhatthang / meta-bandit
Non-stationary Bandits and Meta-Learning with a Small Set of Optimal Arms
bandit meta-learning python3 partial-monitoring sequential-decisions sequential-decision-making-problems multi-task bandit-algorithms meta-bandit
Language:Python 5

masouduut94 / MCTS-agent-python