Additivity in cost spanning tree problems

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

Any de publicació: 2005

Número: 10

Tipus: Document de treball

DIALNET GOOGLE SCHOLAR lock_openAccés obert editor

Resum

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.

Fuente de los datos: Dialnet