Additivity in cost spanning tree problems

  1. Bergantiños Cid, Gustavo
  2. Vidal Puga, Juan José
Journal:
Working paper series ( RGEA )

Year of publication: 2005

Issue: 10

Type: Working paper

DIALNET GOOGLE SCHOLAR lock_openOpen access editor

Abstract

We characterize a rule in cost spanning tree problems using an additiv- ity 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. In both characterizations we can replace separability by population monotonicity.

Data source: Dialnet