Exploitation vs Exploration problem stated as A/B-testing with maximum profit per unit time.
-
Updated
Oct 4, 2023 - Mathematica
Exploitation vs Exploration problem stated as A/B-testing with maximum profit per unit time.
My Little Reinforcement Learning
🐯REPLICA of "Combinatorial Multi-Armed Bandit Based Unknown Worker Recruitment in Heterogeneous Crowdsensing"
🐯REPLICA of "Auction-based combinatorial multi-armed bandit mechanisms with strategic arms"
Typescript implementation of a multi-armed bandit
Adaptive bandit cache selection
Implementation of Multi-Armed Bandit (MAB) algorithms UCB and Epsilon-Greedy. MAB is a class of problems in reinforcement learning where an agent learns to choose actions from a set of arms, each associated with an unknown reward distribution. UCB and Epsilon-Greedy are popular algorithms for solving MAB problems.
A Python library for all popular multi-armed bandit algorithms.
Source code for Assignment 2 of COMP90051 (Semester 2 2020)
Multi-Player Bandits Revisited [L. Besson & É. Kaufmann]
This project implements famous MAB algorithms and evaluates them on the basis of their performance - EpsilonGreedy, UCB, BetaThompson, LinUCB, LinThompson.
Multi-Armed-Bandit solutions on AWS to deliver Covid-19 test kits efficiently and effectively
VLAN Mac-address Authentication Manager
Reinforcement learning techniques applied to solve pricing problems in e-commerce applications. Final project for "Online learning applications" course (2021-2022)
Experiment results using MAB algorithms in Yahoo! Front Page Today Module User Click Log dataset
A Julia Package for providing Multi Armed Bandit Experiments
COLEMAN (Combinatorial VOlatiLE Multi-Armed BANdit) - and strategies for HCS context
Add a description, image, and links to the mab topic page so that developers can more easily learn about it.
To associate your repository with the mab topic, visit your repo's landing page and select "manage topics."