Bounds for Approximate Regret-Matching Algorithms
收藏DataCite Commons2026-01-07 更新2025-04-16 收录
下载链接：
https://service.tib.eu/ldmservice/dataset/16d9f14e-a7ad-4465-a71d-43d0a1da9d00
下载链接
链接失效反馈官方服务：
资源简介：
The dataset used in the paper is a large imperfect-information game, and the authors used it to test their approximate regret-matching algorithm.
提供机构：
TIB
创建时间：
2024-12-16
