Bounds for Approximate Regret-Matching Algorithms

The dataset used in the paper is a large imperfect-information game, and the authors used it to test their approximate regret-matching algorithm.

Data and Resources

Original MetadataJSON
The json representation of the dataset with its distributions based on DCAT.
Explore
- Preview
- Download

Ryan D'Orazio, Dustin Morrill, James R. Wright (2024). Dataset: Bounds for Approximate Regret-Matching Algorithms. https://doi.org/10.57702/v1fmb8m2

DOI retrieved: December 16, 2024

Field	Value
Created	December 16, 2024
Last update	December 16, 2024
Defined In	https://doi.org/10.48550/arXiv.1910.01706
Author	Ryan D'Orazio
More Authors	Dustin Morrill James R. Wright