A Clustering Coefficient Network Formation Game

  • Michael Brautbar
  • Michael Kearns
Conference paper

DOI: 10.1007/978-3-642-24829-0_21

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6982)
Cite this paper as:
Brautbar M., Kearns M. (2011) A Clustering Coefficient Network Formation Game. In: Persiano G. (eds) Algorithmic Game Theory. SAGT 2011. Lecture Notes in Computer Science, vol 6982. Springer, Berlin, Heidelberg


Social and other networks have been shown empirically to exhibit high edge clustering — that is, the density of local neighborhoods, as measured by the clustering coefficient, is often much larger than the overall edge density of the network. In social networks, a desire for tight-knit circles of friendships — the colloquial “social clique” — is often cited as the primary driver of such structure.

We introduce and analyze a new network formation game in which rational players must balance edge purchases with a desire to maximize their own clustering coefficient. Our results include the following:

  • Construction of a number of specific families of equilibrium networks, including ones showing that equilibria can have rather general binary tree-like structure, including highly asymmetric binary trees. This is in contrast to other network formation games that yield only symmetric equilibrium networks. Our equilibria also include ones with large or small diameter, and ones with wide variance of degrees.

  • A general characterization of (non-degenerate) equilibrium networks, showing that such networks are always sparse and paid for by low-degree vertices, whereas high-degree “free riders” always have low utility.

  • A proof that for edge cost α ≥ 1/2 the Price of Anarchy grows linearly with the population size n while for edge cost α less than 1/2, the Price of Anarchy of the formation game is bounded by a constant depending only on α, and independent of n. Moreover, an explicit upper bound is constructed when the edge cost is a ”simple” rational (small numerator) less than 1/2.

  • A proof that for edge cost α less than 1/2 the average vertex clustering coefficient grows at least as fast as a function depending only on α, while the overall edge density goes to zero at a rate inversely proportional to the number of vertices in the network.

  • Results establishing the intractability of even weakly approximating best response computations.

Several of our results hold even for weaker notions of equilibrium, such as those based on link stability.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Michael Brautbar
    • 1
  • Michael Kearns
    • 1
  1. 1.Computer and Information ScienceUniversity of PennsylvaniaPhiladelphia

Personalised recommendations