### Abstract

Original language | English |
---|---|

Place of Publication | Tilburg |

Publisher | Microeconomics |

Number of pages | 19 |

Volume | 2004-53 |

Publication status | Published - 2004 |

### Publication series

Name | CentER Discussion Paper |
---|---|

Volume | 2004-53 |

### Fingerprint

### Keywords

- games
- costs
- population
- allocation
- stochastic processes
- algorithm

### Cite this

*Obligation Rules for Minimum Cost Spanning Tree Situations and their Monotonicity Properties*. (CentER Discussion Paper; Vol. 2004-53). Tilburg: Microeconomics.

}

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

Research output: Working paper › Discussion paper › Other 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 -