A new rule for source connection problems

  1. G. Bergantiños 1
  2. M. Gómez-Rúa 1
  3. N. Llorca 2
  4. M. Pulido 3
  5. J. Sánchez-Soriano 2
  1. 1 Universidade de Vigo
    info

    Universidade de Vigo

    Vigo, España

    ROR https://ror.org/05rdf8595

  2. 2 Universidad Miguel Hernández de Elche
    info

    Universidad Miguel Hernández de Elche

    Elche, España

    ROR https://ror.org/01azzms13

  3. 3 Universidad de Murcia
    info

    Universidad de Murcia

    Murcia, España

    ROR https://ror.org/03p3aeb86

Show affiliations +
Journal:
Working paper series ( RGEA )

Year of publication: 2012

Issue: 1

Type: Working paper

DIALNET GOOGLE SCHOLAR lock_openOpen access editor

Abstract

In this paper we study situations where a group of agents need a service that could be only provided by a source. We call it source connection problems. This class of problems contain the standard …xed tree problems, the classical minimum spanning tree problems and some other related problems like the k hop, the degree constrained and the generalized minimum spanning tree among others. Our goal is to divide the cost of the tree among the agents. We introduce a rule, called painting rule because it can be interpreted through a story about painting. We present some meaningful properties in this context and provide a characterization of the rule.

Data source: Dialnet