COLEMAN (Combinatorial VOlatiLE Multi-Armed BANdit) - and strategies for HCS context
-
Updated
May 22, 2024 - Jupyter Notebook
COLEMAN (Combinatorial VOlatiLE Multi-Armed BANdit) - and strategies for HCS context
Adaptive bandit cache selection
🐯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"
Exploitation vs Exploration problem stated as A/B-testing with maximum profit per unit time.
A Python library for all popular multi-armed bandit algorithms.
Python application to setup and run streaming (contextual) bandit experiments.
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.
Reinforcement learning techniques applied to solve pricing problems in e-commerce applications. Final project for "Online learning applications" course (2021-2022)
👤 Multi-Armed Bandit Algorithms Library (MAB) 👮
My Little Reinforcement Learning
VLAN Mac-address Authentication Manager
Multi-Player Bandits Revisited [L. Besson & É. Kaufmann]
Source code for Assignment 2 of COMP90051 (Semester 2 2020)
Typescript implementation of a multi-armed bandit
Multi-Armed-Bandit solutions on AWS to deliver Covid-19 test kits efficiently and effectively
This project implements famous MAB algorithms and evaluates them on the basis of their performance - EpsilonGreedy, UCB, BetaThompson, LinUCB, LinThompson.
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."