A python implementaion of Counterfactual Regret Minimization using numba
-
Updated
Jan 12, 2022 - Python
#
regret-minimization
Here are 6 public repositories matching this topic...
This repository contains code for the paper "Non-monotonic Resource Utilization in the Bandits with Knapsacks Problem".
-
Updated
Sep 28, 2022 - Python
This repository contains several implementations of multi-armed bandit (MAB) agents applied to a simulated cricket match where an agent selects among different strategies with the goal of maximizing runs while minimizing the risk of getting out.
reinforcement-learning risk-management kl-divergence proababilistic multiarmed-bandits regret-minimization ucb-algorithm
-
Updated
Mar 21, 2025 - Python
Robust Deep Monte Carlo Counterfactual Regret Minimization: Addressing Theoretical Risks in Neural Fictitious Self-Play
reinforcement-learning poker deep-learning monte-carlo solver neural-networks reinforcement-learning-algorithms clipping variance-reduction robustness target-network extensive-games counterfactual-regret-minimization regret-minimization poker-solver deep-cfr mccfr outcome-sampling deep-mccfr
-
Updated
Sep 9, 2025 - Python
Project on preference learning - ENSAE ParisTech
ensae preference-learning regret-minimization label-learning movie-recommender preference-graph instance-preference label-preference
-
Updated
Apr 7, 2023 - Python
Source code for Regret synthesis for two-player turn-based game played on graphs - ICRA 22
-
Updated
Jun 8, 2025 - Python
Improve this page
Add a description, image, and links to the regret-minimization topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the regret-minimization topic, visit your repo's landing page and select "manage topics."