Add to ORKGWe propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core selection and also satisfies cost monotonicity. We also give characterization theorems for the new rule as well as the much-studied Bird allocation. We show that the principal difference between these two rules is in terms of their consistency properties
This paper discusses minimum cost spanning tree games and argues that the standard approach of using...
In this paper, we analyze cost sharing problems arising from a general service by explicitly taking ...
The aim of this paper is to introduce and axiomatically characterize the P-value as a rule to solve ...
We propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core s...
We propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core s...
We characterize, in minimum cost spanning tree problems, the family of rules satisfying monotonicity...
We present a new model for cost sharing in minimum cost spanning tree problems, so that the planner ...
In this paper we present the Subtraction Algorithm that computes for every classical minimum cost sp...
A new way is presented to define for minimum cost spanning tree (mcst-) games the irreducible core, ...
A new way is presented to define for minimum cost spanning tree (mcst) games the irreducible core, w...
Minimum cost spanning tree problems are well known problems in the Operations Research literature. S...
This paper deals with the problem of finding a way to distribute the cost of a minimum cost spanning...
The minimum cost spanning tree game (mcst-game) is a well-known model within operations research gam...
In this paper, we analyze the cost allocation problem when a group of agents or nodes have to be con...
We study minimum cost spanning tree problems and define a cost sharing rule that satisfies many more...
This paper discusses minimum cost spanning tree games and argues that the standard approach of using...
In this paper, we analyze cost sharing problems arising from a general service by explicitly taking ...
The aim of this paper is to introduce and axiomatically characterize the P-value as a rule to solve ...
We propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core s...
We propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core s...
We characterize, in minimum cost spanning tree problems, the family of rules satisfying monotonicity...
We present a new model for cost sharing in minimum cost spanning tree problems, so that the planner ...
In this paper we present the Subtraction Algorithm that computes for every classical minimum cost sp...
A new way is presented to define for minimum cost spanning tree (mcst-) games the irreducible core, ...
A new way is presented to define for minimum cost spanning tree (mcst) games the irreducible core, w...
Minimum cost spanning tree problems are well known problems in the Operations Research literature. S...
This paper deals with the problem of finding a way to distribute the cost of a minimum cost spanning...
The minimum cost spanning tree game (mcst-game) is a well-known model within operations research gam...
In this paper, we analyze the cost allocation problem when a group of agents or nodes have to be con...
We study minimum cost spanning tree problems and define a cost sharing rule that satisfies many more...
This paper discusses minimum cost spanning tree games and argues that the standard approach of using...
In this paper, we analyze cost sharing problems arising from a general service by explicitly taking ...
The aim of this paper is to introduce and axiomatically characterize the P-value as a rule to solve ...