Source code for Regret synthesis for two-player turn-based game played on graphs - ICRA 22
-
Updated
Sep 7, 2024 - Python
Source code for Regret synthesis for two-player turn-based game played on graphs - ICRA 22
Project on preference learning - ENSAE ParisTech
This repository contains code for the paper "Non-monotonic Resource Utilization in the Bandits with Knapsacks Problem".
A python implementaion of Counterfactual Regret Minimization using numba
Add a description, image, and links to the regret-minimization topic page so that developers can more easily learn about it.
To associate your repository with the regret-minimization topic, visit your repo's landing page and select "manage topics."