Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms

作者: 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.

参考文章(26)
Lloyd S. Shapley, A Value for n-person Games Contributions to the Theory of Games. pp. 307- 317 ,(1952) , 10.1017/CBO9780511528446.003
Joseph B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem Proceedings of the American Mathematical Society. ,vol. 7, pp. 48- 50 ,(1956) , 10.1090/S0002-9939-1956-0078686-7
Juan Vidal-Puga, Gustavo Bergantiños, An implementation of the Owen value Games and Economic Behavior. ,vol. 44, pp. 412- 427 ,(2003) , 10.1016/S0899-8256(03)00043-5
Gustavo Bergantiños, Leticia Lorenzo, Noncooperative cost spanning tree games with budget restrictions Naval Research Logistics. ,vol. 55, pp. 747- 757 ,(2008) , 10.1002/NAV.20319
Jens Leth Hougaard, Mich Tvede, Truth-telling and Nash equilibria in minimum cost spanning tree models European Journal of Operational Research. ,vol. 222, pp. 566- 570 ,(2012) , 10.1016/J.EJOR.2012.05.023
Gustavo Bergantiños, Juan J. Vidal-Puga, The optimistic TU game in minimum cost spanning tree problems International Journal of Game Theory. ,vol. 36, pp. 223- 239 ,(2007) , 10.1007/S00182-006-0069-7
Gustavo Bergantiños, Juan J. Vidal-Puga, A fair rule in minimum cost spanning tree problems Journal of Economic Theory. ,vol. 137, pp. 326- 352 ,(2007) , 10.1016/J.JET.2006.11.001
Anirban Kar, Axiomatization of the Shapley Value on Minimum Cost Spanning Tree Games Games and Economic Behavior. ,vol. 38, pp. 265- 277 ,(2002) , 10.1006/GAME.2001.0883