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

V. Feltkamp, S.H. Tijs, S. Muto

Research output: Working paperDiscussion paperOther research output

297 Downloads (Pure)

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.
Original languageEnglish
PublisherUnknown Publisher
Number of pages17
Volume1994-96
Publication statusPublished - 1994

Publication series

NameCentER Discussion Paper
Volume1994-96

Keywords

  • Networks
  • Cost Allocation
  • costs and cost price

Fingerprint Dive into the research topics of 'Minimum cost spanning extension problems: The proportional rule and the decentralized rule'. Together they form a unique fingerprint.

  • Cite this

    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.