Open Access
| Issue |
ITM Web Conf.
Volume 78, 2025
International Conference on Computer Science and Electronic Information Technology (CSEIT 2025)
|
|
|---|---|---|
| Article Number | 01020 | |
| Number of page(s) | 15 | |
| Section | Deep Learning and Reinforcement Learning – Theories and Applications | |
| DOI | https://doi.org/10.1051/itmconf/20257801020 | |
| Published online | 08 September 2025 | |
- Bowling, M., Burch, N., Johanson, M., et al.: 'Heads-up limit hold'em poker is solved', Science, 2015, 347(6218):145–149 [Google Scholar]
- Yakovenko, N., Cao, L., Raffel, C., et al.: 'Poker-CNN: A pattern learning strategy for making draws and bets in poker games using convolutional networks', Proceedings of the AAAI Conference on Artificial Intelligence, 2016, 30(1) [Google Scholar]
- Brown, N., Sandholm, T.: 'Superhuman AI for heads-up no-limit poker: Libratus beats top professionals', Science, 2018, 359(6374): 418–424 [Google Scholar]
- Brown, N., Sandholm, T.: 'Superhuman AI for multiplayer poker', Science, 2019, 365(6456): 885–890 [Google Scholar]
- Zhao, E., Yan, R., Li, J., et al.: 'AlphaHoldem: High-Performance Artificial Intelligence for Heads-Up No-Limit Poker via End-to-End Reinforcement Learning', Proceedings of the AAAI Conference on Artificial Intelligence. 2022, 36(4):4689–4697 [Google Scholar]
- Huale, L., Wang, X., Jia, F., et al.: 'A Survey of Nash Equilibrium Strategy Solving Based on CFR', Archives of Computational Methods in Engineering, 2020, 28: 2749–2760 [Google Scholar]
- Musah, I., Boah, D. K., Seidu, B.: 'A comprehensive review of solution methods and techniques for solving games in game theory', Journal of Game Theory, 2020, 9(2): 25–31 [Google Scholar]
- Brown, N., Sandholm, T.: 'Superhuman AI for Multiplayer Poker', Science, 2019, 365(6456): 885–890 [Google Scholar]
- Brown, N., Sandholm, T.: 'Regret-based Pruning in Extensive-form Games', Advances in Neural Information Processing Systems. Toronto, Ontario, Canada: AAAI Press, 2015: 1972–1980 [Google Scholar]
- Brown, N., Lerer, A., Gross, S., et al.: 'Deep counterfactual regret minimization', Proceedings of the 36th International Conference on Machine Learning (ICML). Long Beach, USA, 2019: 793–802 [Google Scholar]
- Li, H., Hu, K., Zhang, S., et al.: 'Double Neural Counterfactual Regret Minimization', Proceedings of the 8th International Conference on Learning Representations (ICLR), Addis Ababa, Ethiopia, 2020 [Google Scholar]
- Steinberger, E.: 'Single deep counterfactual regret minimization', arXiv preprint arXiv:1901.07621, 2019 [Google Scholar]
- Steinberger, E., Ler, A., Brown, N.: 'Dream: Deep regret minimization with advantage baselines and model-free learning', arXiv preprint arXiv:2006.10410, 2020 [Google Scholar]
- Mcaleer, S., Farina, G., Lanctot, M., et al.: 'Escher: Eschewing importance sampling in games by computing a history value function to estimate regret', arXiv preprint arXiv:2206.04122, 2022. [Google Scholar]
- Xue, K. C.: 'Research on machine gaming with incomplete information based on CFR algorithm', Harbin University of Science and Technology, 2024 [Google Scholar]
- Kash, I. A., Sullins, M., Hofmann, K.: 'Combining no-regret and Q-learning', Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), Auckland, New Zealand, 2020: 593–601 [Google Scholar]
- Hennes, D., Morrill, D., Omidshafiei, S., et al.: 'Neural replicator dynamics: Multiagent learning via hedging policy gradients', Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), Auckland, New Zealand, 2020: 492–501 [Google Scholar]
- Tang, J., Liu, G., Pan, Q. T.: 'A review on representative swarm intelligence algorithms for solving optimization problems: Applications and trends', IEEE/CAA Journal of Automatica Sinica, 2021, 8(10): 1627–1643 [CrossRef] [MathSciNet] [Google Scholar]
- Hu, Z., Chen, S., Yuan, W., Li, P., Chen, J.: 'Online opponent exploitation in Texas Hold'em based on particle swarm optimization'. Control and Decision, 2024, 39(5): 1687–1696 [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.