作者: Gustavo Bergantiños , Juan Vidal-Puga
DOI: 10.1016/J.EJOR.2009.04.003
关键词:
摘要: In the context of minimum cost spanning tree problems, we present a bargaining mechanism for connecting all agents to source and dividing amongst them. The basic idea is very simple: ask each agent part the cost he willing pay an arc be constructed. We prove that there exists unique payoff allocation associated with subgame perfect Nash equilibria this mechanism. Moreover, coincides with the rule defined in Bergantinos Vidal-Puga.