Obligation Rules for Minimum Cost Spanning Tree Situations and their Monotonicity Properties

S.H. Tijs, R. Brânzei, S. Moretti, H.W. Norde

Research output: Working paperDiscussion paperOther research output

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.
Original language English Tilburg Microeconomics 19 2004-53 Published - 2004

Publication series

Name CentER Discussion Paper 2004-53

Costs

Keywords

• games
• costs
• population
• allocation
• stochastic processes
• algorithm

Cite this

Tijs, S. H., Brânzei, R., Moretti, S., & Norde, H. W. (2004). Obligation Rules for Minimum Cost Spanning Tree Situations and their Monotonicity Properties. (CentER Discussion Paper; Vol. 2004-53). Tilburg: Microeconomics.
Tijs, S.H. ; Brânzei, R. ; Moretti, S. ; Norde, H.W. / Obligation Rules for Minimum Cost Spanning Tree Situations and their Monotonicity Properties. Tilburg : Microeconomics, 2004. (CentER Discussion Paper).
@techreport{78d2499410744329b911c93bfdfcdd77,
title = "Obligation Rules for Minimum Cost Spanning Tree Situations and their Monotonicity Properties",
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",
author = "S.H. Tijs and R. Br{\^a}nzei and S. Moretti and H.W. Norde",
note = "Pagination: 19",
year = "2004",
language = "English",
volume = "2004-53",
series = "CentER Discussion Paper",
publisher = "Microeconomics",
type = "WorkingPaper",
institution = "Microeconomics",

}

Tijs, SH, Brânzei, R, Moretti, S & Norde, HW 2004 'Obligation Rules for Minimum Cost Spanning Tree Situations and their Monotonicity Properties' CentER Discussion Paper, vol. 2004-53, Microeconomics, Tilburg.

Obligation Rules for Minimum Cost Spanning Tree Situations and their Monotonicity Properties. / Tijs, S.H.; Brânzei, R.; Moretti, S.; Norde, H.W.

Tilburg : Microeconomics, 2004. (CentER Discussion Paper; Vol. 2004-53).

Research output: Working paperDiscussion paperOther research output

TY - UNPB

T1 - Obligation Rules for Minimum Cost Spanning Tree Situations and their Monotonicity Properties

AU - Tijs, S.H.

AU - Brânzei, R.

AU - Moretti, S.

AU - Norde, H.W.

N1 - Pagination: 19

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

KW - games

KW - costs

KW - population

KW - allocation

KW - stochastic processes

KW - algorithm

M3 - Discussion paper

VL - 2004-53

T3 - CentER Discussion Paper

BT - Obligation Rules for Minimum Cost Spanning Tree Situations and their Monotonicity Properties

PB - Microeconomics

CY - Tilburg

ER -

Tijs SH, Brânzei R, Moretti S, Norde HW. Obligation Rules for Minimum Cost Spanning Tree Situations and their Monotonicity Properties. Tilburg: Microeconomics. 2004. (CentER Discussion Paper).