S. M. Lorenzo Freire, J. M. ALONSO MEIJIDE, A. González Maestro
This framework focuses on the computation of the Folk rule in minimum cost spanning tree problems with groups, which coincides with the Owen value of the cooperative game for the irreducible cost matrix.
To this aim, two polinomial algorithms are provided. The first of them is based on the steps of Kruskal algorithm whereas the other is based on the painting procedure allocation rule.
Futhermore, Boruvka's allocation rule is generalised to the groups problem case.
Relationships between this new rule and the Folk rule with groups are also demonstrated.
Palabras clave: MCST problems, Folk rule, Owen value.
Programado
GT02 Teoría de Juegos III. Avances recientes en Modelos de Decisión Estratégica
10 de junio de 2022 10:10
A14
