Distribution of Matchings in Myerson's Network Formation Model

Abstract

Consider a population of n players playing a variant of Myerson’s network formation model. Each player simultaneously chooses k other players he would want to be connected to. If two players are in each other’s choice set, a matching occurs. We call the outcome of the network formation model a k-uniform Myerson graph and study the distribution of matchings on such graphs with homogeneous and heterogeneous populations.