AI Chat AI Image Generator AI Video Text to Speech

CFR-p: Counterfactual Regret Minimization with Hierarchical Policy Abstraction, and its Application to Two-player Mahjong

07/22/2023

∙

by Shiheng Wang, et al.

∙

∙

Counterfactual Regret Minimization(CFR) has shown its success in Texas Hold'em poker. We apply this algorithm to another popular incomplete information game, Mahjong. Compared to the poker game, Mahjong is much more complex with many variants. We study two-player Mahjong by conducting game theoretical analysis and making a hierarchical abstraction to CFR based on winning policies. This framework can be generalized to other imperfect information games.

page 3

page 4

page 6

research

∙ 11/01/2018

Deep Counterfactual Regret Minimization

Counterfactual Regret Minimization (CFR) is the leading algorithm for so...

0 Noam Brown, et al. ∙

research

∙ 05/27/2019

Learning Policies from Human Data for Skat

Decision-making in large imperfect information games is difficult. Thank...

0 Douglas Rebstock, et al. ∙

research

∙ 04/24/2019

Solving zero-sum extensive-form games with arbitrary payoff uncertainty models

Modeling strategic conflict from a game theoretical perspective involves...

0 Juan Leni, et al. ∙

research

∙ 09/11/2018

Solving Imperfect-Information Games via Discounted Regret Minimization

Counterfactual regret minimization (CFR) is a family of iterative algori...

0 Noam Brown, et al. ∙

research

∙ 05/27/2023

Hierarchical Deep Counterfactual Regret Minimization

Imperfect Information Games (IIGs) offer robust models for scenarios whe...

0 Jiayu Chen, et al. ∙

research

∙ 09/10/2020

RLCFR: Minimize Counterfactual Regret by Deep Reinforcement Learning

Counterfactual regret minimization (CFR) is a popular method to deal wit...

0 Huale Li, et al. ∙

research

∙ 01/22/2019

Single Deep Counterfactual Regret Minimization

Counterfactual Regret Minimization (CFR) is the most successful algorith...

0 Eric Steinberger, et al. ∙