The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources

Bergantiño Cid, GustavoAutor UVIGO; Navarro Ramos, AdrianaAutor UVIGO
DATE: 2019-05
UNIVERSAL IDENTIFIER: http://hdl.handle.net/11093/2507
EDITED VERSION: https://doi.org/10.1016/j.mathsocsci.2019.03.003
UNESCO SUBJECT: 1207 Investigación Operativa
DOCUMENT TYPE: article

ABSTRACT

We consider minimum cost spanning tree problems with multiple sources. We propose a cost allocation rule based on a painting procedure. Agents paint the edges on the paths connecting them to the sources. We prove that the painting rule coincides with the folk rule.
Show full item record

Files in this item

[PDF]
Name:
2019_bergantino_folk_rule_pain ...
Size:
201.9Kb
Format:
PDF
View/Open

Share/ send to

MendeleyZotero
Attribution-NonCommercial-NoDerivatives 4.0 International
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 International