Distribution of matchings in Myerson’s network formation model
(English)Manuscript (preprint) (Other academic)
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 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.
Matching distribution, Myerson network formation model, network formation, Graph theory
Economics Probability Theory and Statistics
Research subject Economics
IdentifiersURN: urn:nbn:se:su:diva-133006OAI: oai:DiVA.org:su-133006DiVA: diva2:956078