A new rule for source connection problems

作者：Bergantinos G; Gomez Rua M^*; Llorca N; Pulido M; Sanchez Soriano J

来源：European Journal of Operational Research, 2014, 234(3): 780-788.

DOI：10.1016/j.ejor.2013.09.047

• Game theory
• Cost sharing
• Source connection problems
• Painting rule
• Axiomatization

In this paper we study situations where a group of agents require a service that can only be provided from a source, the so-called source connection problems. These problems contain the standard fixed tree, the classical minimum spanning tree and some other related problems such as the k-hop, the degree constrained and the generalized minimum spanning tree problems among others. Our goal is to divide the cost of a network among the agents. To this end, we introduce a rule which will be referred to as a painting rule because it can be interpreted by means of a story about painting. Some meaningful properties in this context and a characterization of the rule are provided.

• 出版日期2014-5-1