Cost allocation protocols for supply contract design in network situations
Moretti,S. Tijs,S.H. Brânzei,R. Norde,H.W.
Moretti,S.
Tijs,S.H.
Brânzei,R.
Norde,H.W.
Abstract
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.
Description
Appeared earlier as CentER DP 2005-104 (rt)
Date
2009
Journal Title
Journal ISSN
Volume Title
Publisher
Research Projects
Organizational Units
Journal Issue
Keywords
Citation
Moretti, S, Tijs, S H, Brânzei, R & Norde, H W 2009, 'Cost allocation protocols for supply contract design in network situations', Mathematical Methods of Operations Research, vol. 69, no. 1, pp. 181-202.