Ayuda
Ir al contenido

Dialnet


A new rule for source connection problems

    1. [1] Universidade de Vigo

      Universidade de Vigo

      Vigo, España

    2. [2] Universidad Miguel Hernández de Elche

      Universidad Miguel Hernández de Elche

      Elche, España

    3. [3] Universidad de Murcia

      Universidad de Murcia

      Murcia, España

  • Localización: Working paper series ( RGEA ), Nº. 1, 2012
  • Idioma: inglés
  • Enlaces
  • Resumen
    • español

      game theory, cost sharing, source connection problems, painting rule, axiomatization.

    • English

      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.


Fundación Dialnet

Dialnet Plus

  • Más información sobre Dialnet Plus

Opciones de compartir

Opciones de entorno