Ir al contenido

Documat


Additivity in cost spanning tree problems

  • Autores: Gustavo Bergantiños Cid Árbol académico, Juan José Vidal Puga Árbol académico
  • Localización: Working paper series ( RGEA ), Nº. 10, 2005
  • Idioma: español
  • Enlaces
  • Resumen
    • 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.


Fundación Dialnet

Mi Documat

Opciones de artículo

Opciones de compartir

Opciones de entorno