Open Access · CC BY 4.0
NEAT-SAC: Attention-Pruned Nash Equilibrium for Scalable Multi-Agent Reinforcement Learning
IEEE Access · 2026 · 14 · 122580-122594
DOI: 10.1109/access.2026.3717621 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Access, 2026. Verfasst von Tian-Ci Zhang und 3 weiteren Autor:innen. Die Arbeit nennt 27 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Zhang, T., Hou, S., Wei, Y., & Hao, F. (2026). NEAT-SAC: Attention-Pruned Nash Equilibrium for Scalable Multi-Agent Reinforcement Learning. IEEE Access, 14, 122580-122594. https://doi.org/10.1109/access.2026.3717621
Vancouver
Zhang T, Hou S, Wei Y, Hao F. NEAT-SAC: Attention-Pruned Nash Equilibrium for Scalable Multi-Agent Reinforcement Learning. IEEE Access. 2026;14:122580-122594. doi:10.1109/access.2026.3717621
BibTeX
@article{Zhang2026,
author = {Zhang, Tian-Ci and Hou, Shuai and Wei, Yong-Yong and Hao, Fang},
title = {NEAT-SAC: Attention-Pruned Nash Equilibrium for Scalable Multi-Agent Reinforcement Learning},
journal = {IEEE Access},
year = {2026},
volume = {14},
pages = {122580--122594},
doi = {10.1109/access.2026.3717621}
}
EUVIMED