• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
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
Journal name
Mathematical Methods of Operations Research
Volume
69
Number
1
Publisher
Springer
Pages
181-202
Publication identifier
http://dx.doi.org/10.1007/s00186-008-0226-9
Metadata
Show full item record
Author(s)
Moretti, Stefano cc
Tijs, Stef
Branzei, Rodica
Norde, Henk
Abstract (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.
Subjects / Keywords
Cost allocation; Minimum cost spanning tree games; Cost monotonicity

Related items

Showing items related by title and author.

  • Thumbnail
    The P-value for cost sharing in minimum cost spanning tree situations 
    Moretti, Stefano; Branzei, Rodica; Norde, Henk; Tijs, Stef (2005) Article accepté pour publication ou publié
  • Thumbnail
    Obligation rules for minimum cost spanning tree situations and their monotonicity properties 
    Tijs, Stef; Branzei, Rodica; Moretti, Stefano; Norde, Henk (2006) Article accepté pour publication ou publié
  • Thumbnail
    The Bird Core for Minimum Cost Spanning Tree Problems Revisited: Monotonicity and Additivity Aspects 
    Norde, Henk; Branzei, Rodica; Moretti, Stefano; Tijs, Stef (2006) Chapitre d'ouvrage
  • Thumbnail
    Connection situations under Uncertainty and Cost Monotonic Solutions 
    Branzei, Rodica; Gök, Zeynep Alparslan; Moretti, Stefano; Tijs, Stef (2011) Article accepté pour publication ou publié
  • Thumbnail
    Minimum cost spanning tree games and population monotonic allocation schemes 
    Norde, Henk; Moretti, Stefano; Tijs, Stef (2004) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo