Resumen de Additivity in cost spanning tree problems

Gustavo Bergantiños Cid, Juan José Vidal Puga

• 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.