Myerson网络形成模型中的匹配分布

ERN: Other Game Theory & Bargaining Theory (Topic) Pub Date : 2016-08-29 DOI:10.2139/ssrn.2382336

M. Ghachem

{"title":"Myerson网络形成模型中的匹配分布","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":"{\"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}","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

摘要

假设有n个玩家在玩Myerson网络形成模型的变体。每个玩家同时选择k个他想要联系的其他玩家。如果两个玩家都在对方的选择集中，就会发生匹配。我们将网络形成模型的结果称为k-均匀Myerson图，并研究了这种图上具有同质种群和异质种群的匹配分布。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Distribution of Matchings in Myerson's Network Formation Model

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

ERN: Other Game Theory & Bargaining Theory (Topic)

自引率

0.00%

发文量