随机二部图的协调与反协调的对偶问题
The dual problems of coordination and anti-coordination on random bipartite graphs
摘要:
在某些情况下(“反协调博弈”),个体最好选择与邻居不同的行动,而在其他情况下(“协调博弈”),个体选择与邻居相同的策略是有益的。尽管有不同的激励措施和由此产生的种群动态,但在很大程度上不知道哪种集体结果,反协调或协调,更容易实现。为了解决这个问题,我们集中在二部图的分布图着色问题。我们发现,只有两种策略,反协调游戏(2-着色)和协调游戏(均匀着色)是同样难以解决的对偶问题。为了证明这一点,我们构建了一个同构的马尔可夫链之间产生的相应的反协调和协调游戏下某些特定的个人随机决策规则。我们的研究结果为解决网络上的集体行动问题提供了新的见解。
英文摘要:
In some scenarios ("anti-coordination games"), individuals are better off choosing different actions than their neighbors while in other scenarios ("coordination games"), it is beneficial for individuals to choose the same strategy as their neighbors. Despite having different incentives and resulting population dynamics, it is largely unknown which collective outcome, anti-coordination or coordination, is easier to achieve. To address this issue, we focus on the distributed graph coloring problem on bipartite graphs. We show that with only two strategies, anti-coordination games (2-colorings) and coordination games (uniform colorings) are dual problems that are equally difficult to solve. To prove this, we construct an isomorphism between the Markov chains arising from the corresponding anti-coordination and coordination games under certain specific individual stochastic decision-making rules. Our results provide novel insights into solving collective action problems on networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。