A new rule for source connection problems |
| |
Authors: | G Bergantiños M Gómez-Rúa N Llorca M Pulido J Sánchez-Soriano |
| |
Institution: | 1. Research Group in Economic Analysis, Universidade de Vigo, Spain;2. Centro de Investigación Operativa (CIO), Universidad Miguel Hernández de Elche, Spain;3. Departamento de Estadística e Investigación Operativa, Universidad de Murcia, Spain |
| |
Abstract: | In this paper we study situations where a group of agents require a service that can only be provided from a source, the so-called source connection problems. These problems contain the standard fixed tree, the classical minimum spanning tree and some other related problems such as the k-hop, the degree constrained and the generalized minimum spanning tree problems among others. Our goal is to divide the cost of a network among the agents. To this end, we introduce a rule which will be referred to as a painting rule because it can be interpreted by means of a story about painting. Some meaningful properties in this context and a characterization of the rule are provided. |
| |
Keywords: | Game theory Cost sharing Source connection problems Painting rule Axiomatization |
本文献已被 ScienceDirect 等数据库收录! |
|