Obligation Rules for Minimum Cost Spanning Tree Situations and Their Monotonicity Properties
CentER Discussion Paper No. 2004-53
19 Pages Posted: 23 Jul 2004
Date Written: June 2004
Abstract
We introduce the class of Obligation Rules for Minimum Cost Spanning Tree Situations. The main result of this paper is that such rules are cost monotonic and induce also population monotonic allocation schemes. Another characteristic of Obligation Rules is that they assign to a minimum cost spanning tree situation a vector of cost contributions which can be obtained as product of a double stochastic matrix with the cost vector of edges in the optimal tree provided by the Kruskal algorithm. It turns out that the Potters value (P-value) is an element of this class.
Keywords: Games, costs, population, allocation, stochastic processes, algorithm
Suggested Citation: Suggested Citation
Do you have a job opening that you would like to promote on SSRN?
Recommended Papers
-
Connection Problems in Mountains and Monotonic Allocation Schemes
By Stefano Moretti, Henk Norde, ...
-
The P-Value for Cost Sharing in Minimum Cost Spanning Tree Situations
By Rodica Branzei, Stefano Moretti, ...
-
Defining Rules in Cost Spanning Tree Problems Through the Canonical Form