Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems
نویسنده
چکیده
Minimum cost spanning tree problems connect agents e¢ ciently to a source when agents are located at di¤erent points and the cost of using an edge is xed. The folk and cycle-complete cost sharing solutions always o¤er core allocations. We provide similar characterizations for both. A new property is based on the following observation: when all agents have the same cost to connect to the source, we can connect one of them to the source then connect all other agents to him, as if he was the source. Cost sharing should also be done in these two steps. We also use some common properties: Core Selection, Piecewise Linearity and an independence property. The solutions are di¤erentiated by properties that apply when the cheapest edge to the source gets cheaper. Either the savings are equally distributed among all agents (folk) or the agent on that edge gets all of the savings (cycle-complete). Keywords: Minimum cost spanning tree problems; folk solution; cycle-complete solution; core. JEL Classi cations: C71, D63
منابع مشابه
On Continuous Cost Sharing Solutions for Minimum Cost Spanning Tree Problems
A review of continuous cost sharing solutions for the minimum cost spanning tree problem is proposed, with a particular focus on the folk and Kar solutions. We compare the characterizations proposed, helped by some new results on equivalencies between sets of properties.
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملLinking the Kar and folk solutions through a problem separation property
Minimum cost spanning tree problems try to connect agents e¢ ciently to a source when agents are located at di¤erent points in space and the cost of using an edge is xed. We examine solution concepts to divide the common cost of connection among users, and revisit the dispute between two of the most familiar solutions: the Kar and folk solutions, both based on the familiar Shapley value. We ch...
متن کاملAn axiomatic approach in minimum cost spanning tree problems with groups
We study minimum cost spanning tree problems with groups, where agents are located in di¤erent villages, cities, etc. The groups are the agents of the same village. In Bergantiños and Gómez-Rúa (2010, Economic Theory) we de ne the rule F as the Owen value of the irreducible game with groups and we prove that F generalizes the folk rule of minimum cost spanning tree problems. Bergantiños and Vid...
متن کاملOn the set of extreme core allocations for minimal cost spanning tree problems
Minimal cost spanning tree problems connect agents efficiently to a source when agents are located at different points and the cost of using an edge is fixed. We propose a method, based on the concept of marginal games, to generate all extreme points of the corresponding core. We show that three of the most famous solutions to share the cost of mcst problems, the Bird, folk and cycle-complete s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Social Choice and Welfare
دوره 42 شماره
صفحات -
تاریخ انتشار 2014