Facebook pixel tracking

The Science and Information (SAI) Organization publishes open-access peer-reviewed journals in computer science and artificial intelligence.

Contact Info
Website thesai.org
Follow Us
Contact Info
Follow Us
Research Article | Open Access |

The Coordination Complexity Index: A Parameter-Free Checkpoint Diagnostic for Silent Coordination Failure in Cooperative Multi-Agent Reinforcement Learning

Author 1: Chatchitsanu Pothisakha Author 2: Pudsadee Boonrawd Author 3: Siranee Nuchitprasitchai
International Journal of Advanced Computer Science and Applications (IJACSA) · Vol. 17, No. 9 · Published 2026

DOI: 10.14569/IJACSA.2026.0170998

Abstract

Cooperative multiagent reinforcement learning (MARL) can fail silently while standard reward and loss curves remain inconclusive. This study introduces the Coordination Complexity Index (CCI), a checkpoint statistic with no learned parameters that summarizes dispersion among per-agent greedy Q-values. A frozen checkpoint cannot by itself establish a temporal failure; it can reveal Q-value patterns that motivate further inspection. On Level-Based Foraging (LBF), rules calibrated on the VDN/QMIX/QTRAN triad assign operational high-occupancy, dual-occupancy, and near-zero-dispersion labels, respectively. These labels are not independent proof of stagnation, oscillation, or behavioral roles. The pooled collapsed cohort differs from the non-collapsed LBF cohort by more than four orders of magnitude at the cohort geometric mean, while QMIX attains higher return with lower coordination variance than VDN. Held-out QPLEX falsifies the proposed class-complete-IGM prediction: return is zero, yet C does not approach the collapse cut-off. At 10% of the canonical LBF budget, a retrospective C¯ < 10−3 rule flags all retained QTRAN seeds without flagging retained QMIX seeds; on RWARE it produces at least one environment-induced false positive. CCI is therefore a candidate domain-specific checkpoint screen, not a universal early-stop rule or a coordination-quality score. With the cut-off frozen before evaluation, 5/5 additional QTRAN training seeds remain below it at the retained 10%-budget checkpoint and 5/5 remain below it near 10M steps; this is a positive-class repeatability check, not independent calibration or a new specificity control.

Keywords

How to Cite this Article

Pothisakha, C., Boonrawd, P., & Nuchitprasitchai, S. (2026). The Coordination Complexity Index: A Parameter-Free Checkpoint Diagnostic for Silent Coordination Failure in Cooperative Multi-Agent Reinforcement Learning. International Journal of Advanced Computer Science and Applications, 17(9). https://doi.org/10.14569/IJACSA.2026.0170998

Pothisakha, Chatchitsanu, et al.. "The Coordination Complexity Index: A Parameter-Free Checkpoint Diagnostic for Silent Coordination Failure in Cooperative Multi-Agent Reinforcement Learning." International Journal of Advanced Computer Science and Applications, vol. 17, no. 9, 2026, https://doi.org/10.14569/IJACSA.2026.0170998.

@article{Pothisakha2026,
  title     = {The Coordination Complexity Index: A Parameter-Free Checkpoint Diagnostic for Silent Coordination Failure in Cooperative Multi-Agent Reinforcement Learning},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {17},
  number    = {9},
  year      = {2026},
  publisher = {The Science and Information Organization},
  author    = {Chatchitsanu Pothisakha and Pudsadee Boonrawd and Siranee Nuchitprasitchai},
  doi       = {10.14569/IJACSA.2026.0170998},
  url       = {https://doi.org/10.14569/IJACSA.2026.0170998}
}

Open Access — licensed under a Creative Commons Attribution 4.0 International License. Unrestricted use, distribution, and reproduction in any medium, even commercially, as long as the original work is properly cited.

Call for Papers - Important Dates

Volume 17 No. 11, November 2026
Paper Submission Due October 25, 2026
Review Notification November 15, 2026
Publication Date November 30, 2026