Cost allocation for a spanning tree

DOI10.1002/net.3230030402zbMath0338.90031OpenAlexW2076332815MaRDI QIDQ4105978

Armin Claus, Daniel J. Kleitman

Publication date: 1973

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230030402

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10)

Related Items

The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games ⋮ Multi-criteria minimum cost spanning tree games ⋮ Sharing sequential values in a network ⋮ Minimal Subsidies in Expense Sharing Games ⋮ Generalized minimum spanning tree games ⋮ Operations research games: A survey. (With comments and rejoinder) ⋮ Fair cost-sharing methods for the minimum spanning tree game ⋮ Communication and its cost in graph-restricted games ⋮ On the complexity of testing membership in the core of min-cost spanning tree games ⋮ Proof of permutationally convexity of MCSF games ⋮ The complexity of egalitarian mechanisms for linear programming games ⋮ Allocating costs in set covering problems ⋮ Decentralized pricing in minimum cost spanning trees ⋮ Minimum cost spanning tree games and spillover stability ⋮ On Groves mechanisms for costly inclusion ⋮ An application of crypto cloud computing in social networks by cooperative game theory ⋮ Sharing pollution permits under welfare upper bounds ⋮ The pairwise egalitarian solution. ⋮ Cooperative location games based on the minimum diameter spanning Steiner subgraph problem ⋮ A game-theoretical and cryptographical approach to crypto-cloud computing and its economical and financial aspects ⋮ The degree and cost adjusted folk solution for minimum cost spanning tree games ⋮ Trouble comes in threes: core stability in minimum cost connection networks ⋮ Sharing the proceeds from a hierarchical venture ⋮ On the core of cost-revenue games: minimum cost spanning tree games with revenues ⋮ On the core and nucleolus of minimum cost spanning tree games ⋮ Axiomatization of the Shapley value on minimum cost spanning tree games ⋮ Congestion network problems and related games ⋮ Pricing traffic in a spanning network ⋮ Sharing a minimal cost spanning tree: beyond the folk solution ⋮ Sequential contributions rules for minimum cost spanning tree problems ⋮ Connection situations under uncertainty and cost monotonic solutions ⋮ A note on maximizing the minimum voter satisfaction on spanning trees ⋮ Noncooperative cost spanning tree games with budget restrictions ⋮ Approximate stable solutions in infinite tree problems ⋮ An efficient characterization of submodular spanning tree games ⋮ Cost allocation in spanning network enterprises with stochastic connection costs. ⋮ On the core of network synthesis games ⋮ Minimum cost spanning tree games ⋮ Fair allocation on a network ⋮ AN OVERVIEW ON GAME THEORY APPLICATIONS TO ENGINEERING ⋮ COST SHARING IN NETWORKS: SOME OPEN QUESTIONS ⋮ CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS ⋮ Cost-allocation problems for fuzzy agents in a fixed-tree network ⋮ Cost allocation in the Chinese postman problem ⋮ Three-person spanning tree games ⋮ On some approximately balanced combinatorial cooperative games ⋮ Cooperative interval games: mountain situations with interval data ⋮ Optimal equilibria in the non-cooperative game associated with cost spanning tree problem ⋮ Communication and cooperation in public network situations ⋮ On Analyzing Cost Allocation Problems: Cooperation Building Structures and Order Problem Representations