Add to ORKGIn this paper we provide an axiomatic characterization of the painting rule for minimum cost spanning tree problems with multiple sources. The properties we need are: cone-wise additivity, cost monotonicity, symmetry, isolated agents, and equal treatment of source costs
Minimum cost spanning tree problems have been widely studied in operation research and economic lite...
This paper deals with the problem of finding a way to distribute the cost of a minimum cost spanning...
We propose a simple non-cooperative mechanism of network formation in cost spanning tree problems. T...
In this paper we provide an axiomatic characterization of the painting rule for minimum cost spannin...
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...
In this paper we provide an axiomatic characterization of the folk rule for minimum cost spanning tr...
In this paper, we introduce a family of rules in minimum cost spanning tree problems with multiple s...
We characterize, in minimum cost spanning tree problems, the family of rules satisfying monotonicity...
AbstractBoruvka’s algorithm, which computes a minimum cost spanning tree, is used to define a rule t...
In this paper, we analyze the cost allocation problem when a group of agents or nodes have to be con...
We present a new model for cost sharing in minimum cost spanning tree problems, so that the planner ...
Minimum cost spanning tree problems are well known problems in the Operations Research literature. S...
We propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core ...
The Boruvka's algorithm, which computes the minimum cost spanning tree, is used to define a rule to ...
Minimum cost spanning tree problems have been widely studied in operation research and economic lite...
This paper deals with the problem of finding a way to distribute the cost of a minimum cost spanning...
We propose a simple non-cooperative mechanism of network formation in cost spanning tree problems. T...
In this paper we provide an axiomatic characterization of the painting rule for minimum cost spannin...
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...
In this paper we provide an axiomatic characterization of the folk rule for minimum cost spanning tr...
In this paper, we introduce a family of rules in minimum cost spanning tree problems with multiple s...
We characterize, in minimum cost spanning tree problems, the family of rules satisfying monotonicity...
AbstractBoruvka’s algorithm, which computes a minimum cost spanning tree, is used to define a rule t...
In this paper, we analyze the cost allocation problem when a group of agents or nodes have to be con...
We present a new model for cost sharing in minimum cost spanning tree problems, so that the planner ...
Minimum cost spanning tree problems are well known problems in the Operations Research literature. S...
We propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core ...
The Boruvka's algorithm, which computes the minimum cost spanning tree, is used to define a rule to ...
Minimum cost spanning tree problems have been widely studied in operation research and economic lite...
This paper deals with the problem of finding a way to distribute the cost of a minimum cost spanning...
We propose a simple non-cooperative mechanism of network formation in cost spanning tree problems. T...