Add to ORKGWe study minimum cost spanning tree problems and define a cost sharing rule that satisfies many more properties than other rules in the literature. Furthermore, we provide an axiomatic characterization based on monotonicity properties
In the context of minimum cost spanning tree problems, we present a bargaining mechanism for connect...
Minimum cost spanning extension problems are generalizations of minimum cost spanning tree problems ...
In this paper two cost sharing solutions for minimum cost spanning tree problems are introduced, the...
Tijs et al. [23] introduce the family of obligation rules for minimum cost spanning tree problems. W...
We introduce the class of Obligation rules for minimum cost spanning tree situations.The main result...
We consider the class of Obligation rules for minimum cost spanning tree situations. The main result...
In Tijs et al. (Eur J Oper Res 175:121-134, 2006) a new family of cost allocation rules is introduce...
We propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core s...
AbstractBoruvka’s algorithm, which computes a minimum cost spanning tree, is used to define a rule t...
We propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core s...
In this article, we define a new family of rules in minimum cost spanning tree problems related with...
The aim of this paper is to introduce and axiomatically characterize the P-value as a rule to solve ...
In this paper we provide an axiomatic characterization of the folk rule for minimum cost spanning tr...
We characterize, in minimum cost spanning tree problems, the family of rules satisfying monotonicity...
A review of continuous cost sharing solutions for the minimum cost spanning tree problem is proposed...
In the context of minimum cost spanning tree problems, we present a bargaining mechanism for connect...
Minimum cost spanning extension problems are generalizations of minimum cost spanning tree problems ...
In this paper two cost sharing solutions for minimum cost spanning tree problems are introduced, the...
Tijs et al. [23] introduce the family of obligation rules for minimum cost spanning tree problems. W...
We introduce the class of Obligation rules for minimum cost spanning tree situations.The main result...
We consider the class of Obligation rules for minimum cost spanning tree situations. The main result...
In Tijs et al. (Eur J Oper Res 175:121-134, 2006) a new family of cost allocation rules is introduce...
We propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core s...
AbstractBoruvka’s algorithm, which computes a minimum cost spanning tree, is used to define a rule t...
We propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core s...
In this article, we define a new family of rules in minimum cost spanning tree problems related with...
The aim of this paper is to introduce and axiomatically characterize the P-value as a rule to solve ...
In this paper we provide an axiomatic characterization of the folk rule for minimum cost spanning tr...
We characterize, in minimum cost spanning tree problems, the family of rules satisfying monotonicity...
A review of continuous cost sharing solutions for the minimum cost spanning tree problem is proposed...
In the context of minimum cost spanning tree problems, we present a bargaining mechanism for connect...
Minimum cost spanning extension problems are generalizations of minimum cost spanning tree problems ...
In this paper two cost sharing solutions for minimum cost spanning tree problems are introduced, the...