Dataset Groups Activity Stream 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. BibTex: @dataset{Ryan_D'Orazio_and_Dustin_Morrill_and_James_R_Wright_2024, abstract = {The dataset used in the paper is a large imperfect-information game, and the authors used it to test their approximate regret-matching algorithm.}, author = {Ryan D'Orazio and Dustin Morrill and James R. Wright}, doi = {10.57702/v1fmb8m2}, institution = {No Organization}, keyword = {'approximate regret-matching', 'game theory', 'machine learning', 'regret-matching'}, month = {dec}, publisher = {TIB}, title = {Bounds for Approximate Regret-Matching Algorithms}, url = {https://service.tib.eu/ldmservice/dataset/bounds-for-approximate-regret-matching-algorithms}, year = {2024} }
