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

268 Downloads (Pure)

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 languageEnglish
Place of PublicationTilburg
PublisherMicroeconomics
Number of pages19
Volume2004-53
Publication statusPublished - 2004

Publication series

NameCentER Discussion Paper
Volume2004-53

Keywords

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

Fingerprint Dive into the research topics of 'Obligation Rules for Minimum Cost Spanning Tree Situations and their Monotonicity Properties'. Together they form a unique fingerprint.

  • 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). Microeconomics.