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^2) time algorithms for computing the Shapley value, the nucleolus and the egalitarian allocation of the ultrametric minimum cost spanning tree games, where n is the number of players.

著者

• Ando Kazutoshi

  Shizuoka University

• Kato Shinji

  Shizuoka University

• Ando Kazutoshi

  Shizuoka Univ.

関連論文

• REDUCTION OF ULTRAMETRIC MINIMUM COST SPANNING TREE GAMES TO COST ALLOCATION GAMES ON ROOTED TREES
• LEAST DISTANCE BASED INEFFICIENCY MEASURES ON THE PARETO-EFFICIENT FRONTIER IN DEA

スポンサーリンク