Add to ORKGA 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.
In this paper, we introduce minimum cost spanning tree problems with multiple sources. This new sett...
In this paper we provide an axiomatic characterization of the folk rule for minimum cost spanning tr...
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...
In this paper two cost sharing solutions for minimum cost spanning tree problems are introduced, the...
Abstract: In this paper two cost sharing solutions for minimum cost spanning tree problems are intro...
In Tijs et al. (Eur J Oper Res 175:121-134, 2006) a new family of cost allocation rules is introduce...
We study minimum cost spanning tree problems and define a cost sharing rule that satisfies many more...
A minimum cost spanning tree problem analyzes how to efficiently connect a group of individuals to a...
The aim of this paper is to introduce and axiomatically characterize the P-value as a rule to solve ...
<p>Several authors recently proposed an elegant construction to divide the minimal cost of con...
Several authors recently proposed an elegant construction to divide the minimal cost of connecting a...
In this paper we consider spanning tree problems, where n players want to be con-nected to a source ...
In this paper we consider spanning tree problems, where n players want to be connected to a source a...
We consider a communication network where each pair of users requests a connection guaranteeing a ce...
In this paper, we introduce minimum cost spanning tree problems with multiple sources. This new sett...
In this paper we provide an axiomatic characterization of the folk rule for minimum cost spanning tr...
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...
In this paper two cost sharing solutions for minimum cost spanning tree problems are introduced, the...
Abstract: In this paper two cost sharing solutions for minimum cost spanning tree problems are intro...
In Tijs et al. (Eur J Oper Res 175:121-134, 2006) a new family of cost allocation rules is introduce...
We study minimum cost spanning tree problems and define a cost sharing rule that satisfies many more...
A minimum cost spanning tree problem analyzes how to efficiently connect a group of individuals to a...
The aim of this paper is to introduce and axiomatically characterize the P-value as a rule to solve ...
<p>Several authors recently proposed an elegant construction to divide the minimal cost of con...
Several authors recently proposed an elegant construction to divide the minimal cost of connecting a...
In this paper we consider spanning tree problems, where n players want to be con-nected to a source ...
In this paper we consider spanning tree problems, where n players want to be connected to a source a...
We consider a communication network where each pair of users requests a connection guaranteeing a ce...
In this paper, we introduce minimum cost spanning tree problems with multiple sources. This new sett...
In this paper we provide an axiomatic characterization of the folk rule for minimum cost spanning tr...
We propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core s...