Thumbnail - Request a copy

Cost allocation protocols for supply contract design in network situations

Moretti, Stefano; Tijs, Stef; Branzei, Rodica; Norde, Henk (2009), Cost allocation protocols for supply contract design in network situations, Mathematical Methods of Operations Research, 69, 1, p. 181-202. http://dx.doi.org/10.1007/s00186-008-0226-9

Type
Article accepté pour publication ou publié
Date
2009
Nom de la revue
Mathematical Methods of Operations Research
Volume
69
Numéro
1
Éditeur
Springer
Pages
181-202
Identifiant publication
Métadonnées
Afficher la notice complète
Auteur(s)
Moretti, Stefano cc
Tijs, Stef
Branzei, Rodica
Norde, Henk
Résumé (EN)
The class of Construct and Charge (CC-) rules for minimum cost spanning tree (mcst) situations is considered. CC-rules are defined starting from the notion of charge systems, which specify particular allocation protocols rooted on the Kruskal algorithm for computing an mcst. These protocols can be easily implemented in practical network situations (for instance, in supply transportation networks), are flexible to changes in the network situation and meet the requirement of continuous monitoring by the agents involved. Special charge systems, that we call conservative, lead to a subclass of CC-rules that coincides with the class of obligation rules for mcst situations.
Mots-clés
Cost allocation; Minimum cost spanning tree games; Cost monotonicity