scientific article; zbMATH DE number 970005

MaRDI QIDQ5688121zbMATH OpenFDO

Authors Kathryn J. Kent, Darko Skorin-Kapov

Publication date 11 March 1997

zbMATH Keywords

cost allocationsminimum cost spanning treenetwork

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Programming involving graphs or networks (90C35)

Recommendations

• Minimum cost spanning tree games and population monotonic allocation schemes.
• A note on Steiner tree games
• Connection problems in mountains and monotonic allocation schemes.
• scientific article; zbMATH DE number 5666824
• Some notes on cost allocation in multicasting

Cited in

(12)

• Fair cost-sharing methods for scheduling jobs on parallel machines
• Minimum cost spanning tree games and population monotonic allocation schemes.
• Obligation rules for minimum cost spanning tree situations and their monotonicity properties
• Cost-sharing mechanisms for network design
• The P-value for cost sharing in minimum
• Some notes on cost allocation in multicasting
• Fair allocation on a network
• Algorithmic solutions for maximizing shareable costs
• Connection problems in mountains and monotonic allocation schemes.
• Connection situations under uncertainty and cost monotonic solutions
• Sharing the cost of multicast transmissions in wireless networks
• Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5688121)