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

0 Người đánh giá. Xếp hạng trung bình 0

Tác giả: Shiheng Wang

Ngôn ngữ: eng

Ký hiệu phân loại: 519.3 Game theory

Thông tin xuất bản: 2023

Mô tả vật lý:

Bộ sưu tập: Metadata

ID: 197777

Thêm vào giỏ Liên kết toàn văn

Comment: 8 pagesCounterfactual 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.

Tạo bộ sưu tập với mã QR