{"title":"Distribution of Matchings in Myerson's Network Formation Model","authors":"M. Ghachem","doi":"10.2139/ssrn.2382336","DOIUrl":null,"url":null,"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.","PeriodicalId":393761,"journal":{"name":"ERN: Other Game Theory & Bargaining Theory (Topic)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2016-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ERN: Other Game Theory & Bargaining Theory (Topic)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.2382336","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
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.