Minimum-cost spanning tree problems are well-known problems in the operations research literature. Some agents, located at different geographical places, want a service provided by a common supplier. Agents will be served through costly connections. Some part of the literature has focused, mainly, in studying how to allocate the connection cost among the agents. We review the papers that have addressed the allocation problem using cooperative game theory. We also relate the rules defined through cooperative games with rules defined directly from the problem, either through algorithms for computing a minimal tree, either through a cone-wise decomposition.

中文翻译：

---

最小费用生成树问题的合作规则及其相关算法的综述

最小成本的生成树问题是运筹学文献中众所周知的问题。一些位于不同地理位置的代理商希望由共同的供应商提供服务。代理将通过昂贵的连接服务。文献的某些部分主要集中在研究如何在代理之间分配连接成本。我们回顾了使用合作博弈论解决分配问题的论文。我们还将通过合作博弈定义的规则与直接从问题定义的规则相关联，或者通过计算最小树的算法，或者通过锥形分解，将规则与问题直接定义。