.png){kind=icon}
.png){kind=icon}
Return
A new rule for source connection problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2013.09.047.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Game theory
Cost sharing
Source connection problems
Painting rule
Axiomatization
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
View more organizations