### Abstract

*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.

Original language | English |
---|---|

Pages (from-to) | 181-202 |

Journal | Mathematical Methods of Operations Research |

Volume | 69 |

Issue number | 1 |

Publication status | Published - 2009 |

### Fingerprint

### Cite this

*Mathematical Methods of Operations Research*,

*69*(1), 181-202.

}

*Mathematical Methods of Operations Research*, vol. 69, no. 1, pp. 181-202.

**Cost allocation protocols for supply contract design in network situations.** / Moretti, S.; Tijs, S.H.; Brânzei, R.; Norde, H.W.

Research output: Contribution to journal › Article › Scientific › peer-review

TY - JOUR

T1 - Cost allocation protocols for supply contract design in network situations

AU - Moretti, S.

AU - Tijs, S.H.

AU - Brânzei, R.

AU - Norde, H.W.

N1 - Appeared earlier as CentER DP 2005-104 (rt)

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

M3 - Article

VL - 69

SP - 181

EP - 202

JO - Mathematical Methods of Operations Research

JF - Mathematical Methods of Operations Research

SN - 1432-2994

IS - 1

ER -