A new stable and more responsive cost sharing solution for minimum cost spanning tree problems

详细信息	查看全文 | 推荐本文 |

• 作者：Christian Trudeau ^{trudeauc@uwindsor.ca}
• 关键词：C71 ; D70 ; D85
• 刊名：Games and Economic Behavior
• 出版年：2012
• 期刊代码：67_08998256
• 类别：mt
• 出版时间：May, 2012
• 卷：75
• 期：1
• 页码：402-412
• 文件大小：219 K

摘要

Minimum cost spanning tree (mcst) problems try to connect agents efficiently to a source when agents are located at different points in space and the cost of using an edge is fixed. We introduce a new cost sharing solution that always selects a point in the core and that is more responsive to changes than the well-studied folk solution. The paper shows a sufficient condition for the concavity of the stand-alone cost game. Modifying the game to make sure the condition is satisfied and then taking the Shapley value gives the new solution.