A new rule for source connection problems

被引：12

作者：

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
Althaus, E
Funke, S
Har-Peled, S
Könemann, J
Ramos, EA
Skutella, M
[J]. OPERATIONS RESEARCH LETTERS, 2005, 33 (02) : 115 - 120
[2] [Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
[3] A cost allocation rule for k-hop minimum cost spanning tree problems
Bergantinos, G.
Gomez-Rua, M.
Llorca, N.
Pulido, M.
Sanchez-Soriano, J.
[J]. OPERATIONS RESEARCH LETTERS, 2012, 40 (01) : 52 - 55
[4] A fair rule in minimum cost spanning tree problems
Bergantinos, Gustavo
Vidal-Puga, Juan J.
[J]. JOURNAL OF ECONOMIC THEORY, 2007, 137 (01) : 326 - 352
[5] The optimistic TU game in minimum cost spanning tree problems
Bergantinos, Gustavo
Vidal-Puga, Juan J.
[J]. INTERNATIONAL JOURNAL OF GAME THEORY, 2007, 36 (02) : 223 - 239
[6] Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms
Bergantinos, Gustavo
Vidal-Puga, Juan
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 201 (03) : 811 - 820
[7] Additivity in minimum cost spanning tree problems
Bergantinos, Gustavo
Vidal-Puga, Juan
[J]. JOURNAL OF MATHEMATICAL ECONOMICS, 2009, 45 (1-2) : 38 - 42
[8] COST ALLOCATION FOR A SPANNING TREE - GAME THEORETIC APPROACH
BIRD, CG
[J]. NETWORKS, 1976, 6 (04) : 335 - 350
[9] Branzei R, 2004, THEOR DECIS, V56, P47
[10] Cost monotonicity, consistency and minimum cost spanning tree games
Dutta, B
Kar, A
[J]. GAMES AND ECONOMIC BEHAVIOR, 2004, 48 (02) : 223 - 248

← 1 2 3 →