Add to ORKGWe present a new model for cost sharing in minimum cost spanning tree problems, so that the planner can identify the agents that merge. Under this new framework, and as opposed to the traditional model, there exist rules that satisfy merge-proofness. Besides, by strengthening this property and adding some other properties, such as population-monotonicity and solidarity, we characterize a unique rule that coincides with the weighted Shapley value of an associated cost game
AbstractBoruvka’s algorithm, which computes a minimum cost spanning tree, is used to define a rule t...
In this paper, we introduce a family of rules in minimum cost spanning tree problems with multiple s...
This paper discusses minimum cost spanning tree games and argues that the standard approach of using...
We present a new model for cost sharing in minimum cost spanning tree problems, so that the planner ...
We characterize, in minimum cost spanning tree problems, the family of rules satisfying monotonicity...
We propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core ...
In the context of cost sharing in minimum cost spanning tree problems, we introduce a property calle...
In this paper we present the Subtraction Algorithm that computes for every classical minimum cost sp...
Minimum cost spanning tree problems are well known problems in the Operations Research literature. S...
The Boruvka's algorithm, which computes the minimum cost spanning tree, is used to define a rule to ...
We propose a simple non-cooperative mechanism of network formation in cost spanning tree problems. T...
This paper deals with the problem of finding a way to distribute the cost of a minimum cost spanning...
We propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core s...
We study minimum cost spanning tree problems for a set of users connected to a source. Prim’s algori...
The aim of this paper is to introduce and axiomatically characterize the P-value as a rule to solve ...
AbstractBoruvka’s algorithm, which computes a minimum cost spanning tree, is used to define a rule t...
In this paper, we introduce a family of rules in minimum cost spanning tree problems with multiple s...
This paper discusses minimum cost spanning tree games and argues that the standard approach of using...
We present a new model for cost sharing in minimum cost spanning tree problems, so that the planner ...
We characterize, in minimum cost spanning tree problems, the family of rules satisfying monotonicity...
We propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core ...
In the context of cost sharing in minimum cost spanning tree problems, we introduce a property calle...
In this paper we present the Subtraction Algorithm that computes for every classical minimum cost sp...
Minimum cost spanning tree problems are well known problems in the Operations Research literature. S...
The Boruvka's algorithm, which computes the minimum cost spanning tree, is used to define a rule to ...
We propose a simple non-cooperative mechanism of network formation in cost spanning tree problems. T...
This paper deals with the problem of finding a way to distribute the cost of a minimum cost spanning...
We propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core s...
We study minimum cost spanning tree problems for a set of users connected to a source. Prim’s algori...
The aim of this paper is to introduce and axiomatically characterize the P-value as a rule to solve ...
AbstractBoruvka’s algorithm, which computes a minimum cost spanning tree, is used to define a rule t...
In this paper, we introduce a family of rules in minimum cost spanning tree problems with multiple s...
This paper discusses minimum cost spanning tree games and argues that the standard approach of using...