• 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

Minimum cost spanning tree games and population monotonic allocation schemes

Norde, Henk; Moretti, Stefano; Tijs, Stef (2004), Minimum cost spanning tree games and population monotonic allocation schemes, European Journal of Operational Research, 154, 1, p. 84-97. http://dx.doi.org/10.1016/S0377-2217(02)00714-2

View/Open
minimum_moretti.PDF (256.8Kb)
Type
Article accepté pour publication ou publié
Date
2004
Journal name
European Journal of Operational Research
Volume
154
Number
1
Publisher
Elsevier
Pages
84-97
Publication identifier
http://dx.doi.org/10.1016/S0377-2217(02)00714-2
Metadata
Show full item record
Author(s)
Norde, Henk
Moretti, Stefano cc
Tijs, Stef
Abstract (EN)
In this paper we present the Subtraction Algorithm that computes for every classical minimum cost spanning tree game a population monotonic allocation scheme. As a basis for this algorithm serves a decomposition theorem that shows that every minimum cost spanning tree game can be written as nonnegative combination of minimum cost spanning tree games corresponding to 0–1 cost functions. It turns out that the Subtraction Algorithm is closely related to the famous algorithm of Kruskal for the determination of minimum cost spanning trees. For variants of the classical minimum cost spanning tree games we show that population monotonic allocation schemes do not necessarily exist.
Subjects / Keywords
Minimum cost spanning tree games; Population monotonic allocation schemes

Related items

Showing items related by title and author.

  • 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
    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
    Cost allocation protocols for supply contract design in network situations 
    Moretti, Stefano; Tijs, Stef; Branzei, Rodica; Norde, Henk (2009) Article accepté pour publication ou publié
  • 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é
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