Table 1. Overview of our topological Price of Anarchy bounds for symmetric and asymmetric clustering games. A “+” or “1” in the column “distr. α” indicates whether the distribution rule α is positive or equal-split, respectively. ᾱ is the maximum disparity, and c is the number of colors. ρ(G) and Δ(G) refer to the maximum subgraph density and the maximum degree of G, respectively. The stated bounds for random graphs hold with high probability.
...read more