ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2307.12087
  4. Cited By
CFR-p: Counterfactual Regret Minimization with Hierarchical Policy
  Abstraction, and its Application to Two-player Mahjong

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

22 July 2023
Shiheng Wang
    OffRL
ArXiv (abs)PDFHTML

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

2 / 2 papers shown
Title
Deep Counterfactual Regret Minimization
Deep Counterfactual Regret Minimization
Noam Brown
Adam Lerer
Sam Gross
Tuomas Sandholm
117
215
0
01 Nov 2018
Safe and Nested Subgame Solving for Imperfect-Information Games
Safe and Nested Subgame Solving for Imperfect-Information Games
Noam Brown
Tuomas Sandholm
86
182
0
08 May 2017
1