English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Counterfactual Regret Minimization (CFR) and its variants developed basedupon Regret Matching (RM) have been considered to be the best method to solveincomplete information extensive form games. In addition to RM and CFR,Fictitious Play (FP) is another equilibrium computation algorithm in normalform games. Previous experience has shown that the convergence rate of FP isslower than RM and FP is difficult to use in extensive form games. However,recent research has made improvements in both issues. Firstly, Abernethyproposed a new FP variant sync FP, which has faster convergence rate than RM+.Secondly, Qi introduced FP into extensive form games and proposed Pure CFR(PCFR). This paper combines these two improvements, resulting in a newalgorithm sync PCFR. In our experiment, the convergence rate of sync PCFR isapproximately an order of magnitude faster than CFR+ (state-of-the-artalgorithm for equilibrium computation in incomplete information extensive formgames), while requiring less memory in an iteration.

Sync Pure Counterfactual Regret Minimization in Incomplete Information Extensive Form Games