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
-
Playing by the rules: Government regulation and consumer trust in the online poker industry
by: Kahlil S. Philander, et al.
Published: (2025-03-01) -
Happiness and Status: the Zero-Sum Game?
by: I. V. Galochkin
Published: (2011-06-01) -
The turnpike property for dynamic discrete time zero-sum games
by: Alexander J. Zaslavski
Published: (1999-01-01) -
Evaluation of novel fungicides (FRAC groups 7, 9, 12) for managing cranberry fruit rot
by: Leela Saisree Uppala, et al.
Published: (2025-02-01) -
Competitive two person zero-sum game with linear increment function
by: Jolanta Dranseikienė, et al.
Published: (2000-12-01)