Back to Search
Start Over
Obligation Rules for Minimum Cost Spanning Tree Situations and their Monotonicity Properties
- Source :
- European Journal of Operational Research, 175(1), 121-134. Elsevier Science BV, Tilburg University-PURE
- Publication Year :
- 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.
- Subjects :
- Class (set theory)
Cost allocation
Mathematical optimization
education.field_of_study
Information Systems and Management
Spanning tree
General Computer Science
Stochastic process
Computer science
Population
Stochastic matrix
games
costs
population
allocation
stochastic processes
algorithm
Monotonic function
Management Science and Operations Research
Tree (graph theory)
Industrial and Manufacturing Engineering
Distributed minimum spanning tree
Tree (data structure)
Kruskal's algorithm
Modeling and Simulation
education
Mathematics
Subjects
Details
- ISSN :
- 03772217
- Database :
- OpenAIRE
- Journal :
- European Journal of Operational Research, 175(1), 121-134. Elsevier Science BV, Tilburg University-PURE
- Accession number :
- edsair.doi.dedup.....91451d133d52e2825ad6f4abf55a193d