Minimum-cost spanning tree games: Bird rule revisited
نویسندگان
چکیده
منابع مشابه
Multi-criteria minimum cost spanning tree games
The minimum cost spanning tree game (mcst-game) is a well-known model within operations research games that has been widely studied in the literature. In this paper we introduce the multi-criteria version of the mcst-game as a setvalued TU-game. We prove that the extension of Bird s cost allocation rule provides dominance core elements in this game. We also give a family of core solutions that ...
متن کاملSubmodularity of minimum-cost spanning tree games
We give a necessary condition and a sufficient condition for a minimum-cost spanning tree game introduced by Bird to be submodular (or convex). When the cost is restricted to two values, we give a characterization of submodular minimum-cost spanning tree games. We also discuss algorithmic issues.
متن کاملCost monotonicity, consistency and minimum cost spanning tree games
We propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core selection and also satis...es cost monotonicity. We also give characterization theorems for the new rule as well as the much-studied Bird allocation. We show that the principal di¤erence between these two rules is in terms of their consistency properties. JEL Classi...cation Numbers: D7
متن کاملA fair rule in minimum cost spanning tree problems
We study minimum cost spanning tree problems and de ne a cost sharing rule that satis es many more properties than other rules in the literature. Furthermore, we provide an axiomatic characterization based on monotonicity properties. Keywords: Spanning tree. Cost allocation. Monotonicity. JEL Classi cation Numbers: C71, D63, D7.
متن کاملReduction of Ultrametric Minimum Cost Spanning Tree Games to Cost Allocation Games on Rooted Trees
A minimum cost spanning tree game is called ultrametric if the cost function on the edges of the underlying network is an ultrametric. We show that every ultrametric minimum cost spanning tree game is reduced to a cost allocation game on a rooted tree. It follows that there exist O(n) time algorithms for computing the Shapley value, the nucleolus and the egalitarian allocation of the ultrametri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SCIENTIA SINICA Mathematica
سال: 2020
ISSN: 1674-7216
DOI: 10.1360/ssm-2020-0060