arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1106.2440math.OCcs.GT
收藏

网络拓扑的博弈论视角

A Game Theoretic Perspective on Network Topologies

Shaun Lichter, Christopher Griffin, Terry Friesz

摘要:

作为统计物理界的图形形成模型的另一种观点,我们介绍了图形形成模型,通过自私的竞争,通过\textit{network formation}作为一种方法来建模具有特定拓扑结构的图形。我们进一步研究了我们的研究结果的具体应用,合作寡头。推广了Goyal和Joshi(S. Goyal和S.乔希寡头垄断中的合作网络。Games and Economic behavior,43(1):57-85,2003),他首先考虑了寡头垄断的协作网络问题,并表明在某些线性假设下,网络协作通过自私竞争产生稳定的完全图。我们表明,与非线性费用函数和球员的回报改变,稳定的合作图与任意程度的序列可以导致。

英文摘要:

As an alternative view to the graph formation models in the statistical physics community, we introduce graph formation models using \textit{network formation} through selfish competition as an approach to modeling graphs with particular topologies. We further investigate a specific application of our results to collaborative oligopolies. We extend the results of Goyal and Joshi (S. Goyal and S. Joshi. Networks of collaboration in oligopoly. Games and Economic behavior, 43(1):57-85, 2003), who first considered the problem of collaboration networks of oligopolies and showed that under certain linear assumptions network collaboration produced a stable complete graph through selfish competition. We show with nonlinear cost functions and player payoff alteration that stable collaboration graphs with an arbitrary degree sequence can result.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑