Fig. 9: Response graph complexity vs. computational complexity of solving associated games. | Nature Communications

Fig. 9: Response graph complexity vs. computational complexity of solving associated games.

From: Navigating the landscape of multiplayer games

Fig. 9: Response graph complexity vs. computational complexity of solving associated games.The alternative text for this image may have been generated using AI.

Each figure plots a respective measure of graph complexity against the normalized number of iterations needed to solve the associated game via the Double Oracle algorithm (with normalization done with respect to the total number of strategies in each underlying game). The Spearman correlation coefficient, ρs, is shown in each figure (with the reported two-sided p-value rounded to two decimals).

Back to article page