Gustavo Bergantiños Cid, María Gómez Rúa, Natividad Llorca Pascual, Manuel Andrés Pulido Cayuela, Joaquín Sánchez Soriano
game theory, cost sharing, source connection problems, painting rule, axiomatization.
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.
© 2001-2025 Fundación Dialnet · Todos los derechos reservados