Comparative analysis of extensive form zero sum game algorithms for Poker like games
Abstract The resolution of extensive-form zero-sum games is a fundamental challenge in computational game theory, addressed through various algorithms, each with unique strengths and limitations. This paper presents a comprehensive comparison of leading algorithms, using Poker-like games as benchmar...
Saved in:
Main Authors: | Behbod Keshavarzi, Hamidreza Navidi |
---|---|
Format: | Article |
Language: | English |
Published: |
Nature Portfolio
2025-01-01
|
Series: | Scientific Reports |
Subjects: | |
Online Access: | https://doi.org/10.1038/s41598-025-86899-8 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Survey on intelligent game of computer poker
by: Weilin YUAN, et al.
Published: (2021-10-01) -
Playing by the rules: Government regulation and consumer trust in the online poker industry
by: Kahlil S. Philander, et al.
Published: (2025-03-01) -
Optimization mechanism of attack and defense strategy in honeypot game with evidence for deception
by: Lihua SONG, et al.
Published: (2022-11-01) -
Happiness and Status: the Zero-Sum Game?
by: I. V. Galochkin
Published: (2011-06-01) -
Research on CFR algorithm for Internet
by: ZHANG Xin1, et al.
Published: (2006-01-01)