A new rule for source connection problems

被引：13

作者：

Bergantinos, G. ^{[1
]}

Gomez-Rua, M. ^{[1
]}

Llorca, N. ^{[2
]}

Pulido, M. ^{[3
]}

Sanchez-Soriano, J. ^{[2
]}

机构：

[1] Univ Vigo, Res Grp Econ Anal, Vigo 36310, Pontevedra, Spain

[2] Univ Miguel Hernandez de Elche, CIO, Elche, Spain

[3] Univ Murcia, Dept Estadist & Invest Operat, E-30001 Murcia, Spain

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2014年 / 234卷 / 03期

关键词：

Game theory; Cost sharing; Source connection problems; Painting rule; Axiomatization; SPANNING TREE; COST ALLOCATION; MONOTONICITY; NETWORK; GAME;

D O I：

10.1016/j.ejor.2013.09.047

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

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. (C) 2013 Elsevier B.V. All rights reserved.

引用

页码：780 / 788

页数：9

共 29 条

[1] Approximating k-hop minimum-spanning trees [J].