Munich Personal RePEc Archive

Characterization of the painting rule for multi-source minimal cost spanning tree problems

Bergantiños, Gustavo and Navarro, Adriana (2019): Characterization of the painting rule for multi-source minimal cost spanning tree problems.

[img] PDF
MPRA_paper_93266.pdf

Download (264kB)

Abstract

In this paper we provide an axiomatic characterization of the painting rule for minimum cost spanning tree problems with multiple sources. The properties we need are: cone-wise additivity, cost monotonicity, symmetry, isolated agents, and equal treatment of source costs.

UB_LMU-Logo
MPRA is a RePEc service hosted by
the Munich University Library in Germany.