Additivity in minimum cost spanning tree problems

B-Tier
Journal: Journal of Mathematical Economics
Year: 2009
Volume: 45
Issue: 1-2
Pages: 38-42

Authors (2)

Bergantiños, Gustavo (Universidade de Vigo) Vidal-Puga, Juan (Universidade de Vigo)

Score contribution per author:

1.005 = (α=2.01 / 2 authors) × 1.0x B-tier

α: calibrated so average coauthorship-adjusted count equals average raw count

View Full Article View on IDEAS/RePEc

Abstract

We characterize a rule in minimum cost spanning tree problems using an additivity property and some basic properties. If the set of possible agents has at least three agents, these basic properties are symmetry and separability. If the set of possible agents has two agents, we must add positivity.

Technical Details

RePEc Handle
repec:eee:mateco:v:45:y:2009:i:1-2:p:38-42
Journal Field
Theory
Author Count
2
Added to Database
2026-01-24