Thumbnail Image
Item

Minimum cost spanning extension problems: The proportional rule and the decentralized rule

Feltkamp,V.
; 
Tijs,S.H.
; 
Muto,S.
Abstract
Minimum cost spanning extension problems are generalizations of minimum cost spanning tree problems (see Bird 1976) where an existing network has to be extended to connect users to a source. In this paper, we present two cost allocation rules for these problems, viz. the proportional rule and the decentralized rule. We introduce algorithms that generate these rules and prove that both rules are refinements of the irreducible core, as defined in Feltkamp, Tijs and Muto (1994b). We then proceed to axiomatically characterize the proportional rule.
Description
Pagination: 17
Date
1994
Journal Title
Journal ISSN
Volume Title
Publisher
Unknown Publisher
Collections
Tilburg University Research Output Collection
Show all metadata
Files
Thumbnail Image
96.pdf
Adobe PDF, 418.98 KB
Research Projects
Organizational Units
Journal Issue
Keywords
Networks, Cost Allocation, costs and cost price
Citation
Feltkamp, V, Tijs, S H & Muto, S 1994 'Minimum cost spanning extension problems : The proportional rule and the decentralized rule' CentER Discussion Paper, vol. 1994-96, Unknown Publisher.
URI
https://hdl.handle.net/20.500.14602/26196
Embedded videos