Minimum cost spanning tree problems with groups

  1. Bergantiños Cid, Gustavo
  2. Gómez Rúa, María
Liburua:
XXXI Congreso Nacional de Estadística e Investigación Operativa ; V Jornadas de Estadística Pública: Murcia, 10-13 de febrero de 2009 : Libro de Actas

Argitaletxea: Universidad de Murcia. Departamento de Estadística e Investigación Operativa

ISBN: 978-84-691-8159-1

Argitalpen urtea: 2009

Biltzarra: Congreso Nacional de Estadística e Investigación Operativa (31. 2009. Murcia)

Mota: Biltzar ekarpena

DIALNET GOOGLE SCHOLAR

Laburpena

We study minimum cost spanning tree problems with groups. We assume that agents are located in di erent villages, cities, etc. The groups are the agents of the same village. We introduce a rule for dividing the cost of connecting all agents to the source among the agents taking into account the group structure. We characterize this rule with several desirable properties. We prove that this rule coincides with the Owen value of the TU game associated with the irreducible matrix.

Datuen iturria: Dialnet