AbstractBoruvka’s algorithm, which computes a minimum cost spanning tree, is used to define a rule to share the cost among the nodes (agents). We show that this rule coincides with the folk solution, a very well-known rule of this literature
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...
In this paper, we analyze the cost allocation problem when a group of agents or nodes have to be con...
The Boruvka's algorithm, which computes the minimum cost spanning tree, is used to define a rule to ...
AbstractBoruvka’s algorithm, which computes a minimum cost spanning tree, is used to define a rule t...
A minimum cost spanning tree problem analyzes how to efficiently connect a group of individuals to a...
We consider minimum cost spanning tree problems with multiple sources. We propose a cost allocation ...
We consider a problem where a group of agents is interested in some goods provided by a supplier wit...
This paper deals with the problem of finding a way to distribute the cost of a minimum cost spanning...
We study minimum cost spanning tree problems for a set of users connected to a source. Prim’s algori...
In this paper, we introduce a family of rules in minimum cost spanning tree problems with multiple s...
Minimum cost spanning tree problems are well known problems in the Operations Research literature. S...
A minimum cost spanning tree problem analyzes the way to efficiently connect individuals to a source...
We propose to allocate the cost of a minimum cost spanning tree by defining a claims problem and usi...
We propose a simple non-cooperative mechanism of network formation in cost spanning tree problems. T...
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...
In this paper, we analyze the cost allocation problem when a group of agents or nodes have to be con...
The Boruvka's algorithm, which computes the minimum cost spanning tree, is used to define a rule to ...
AbstractBoruvka’s algorithm, which computes a minimum cost spanning tree, is used to define a rule t...
A minimum cost spanning tree problem analyzes how to efficiently connect a group of individuals to a...
We consider minimum cost spanning tree problems with multiple sources. We propose a cost allocation ...
We consider a problem where a group of agents is interested in some goods provided by a supplier wit...
This paper deals with the problem of finding a way to distribute the cost of a minimum cost spanning...
We study minimum cost spanning tree problems for a set of users connected to a source. Prim’s algori...
In this paper, we introduce a family of rules in minimum cost spanning tree problems with multiple s...
Minimum cost spanning tree problems are well known problems in the Operations Research literature. S...
A minimum cost spanning tree problem analyzes the way to efficiently connect individuals to a source...
We propose to allocate the cost of a minimum cost spanning tree by defining a claims problem and usi...
We propose a simple non-cooperative mechanism of network formation in cost spanning tree problems. T...
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...
In this paper, we analyze the cost allocation problem when a group of agents or nodes have to be con...
DOI
Add to ORKG