Cost allocation for a spanning tree

Cited in

(56)

Communication and its cost in graph-restricted games
Cost allocation in the Chinese postman problem
Operations research games: A survey. (With comments and rejoinder)
On the complexity of testing membership in the core of min-cost spanning tree games
The pairwise egalitarian solution.
Three-person spanning tree games
Sharing sequential values in a network
The complexity of egalitarian mechanisms for linear programming games
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
Cost allocation in spanning network enterprises with stochastic connection costs.
Multi-criteria minimum cost spanning tree games
Minimum cost spanning tree games and spillover stability
Pricing traffic in a spanning network
Cost-allocation problems for fuzzy agents in a fixed-tree network
Allocating costs in set covering problems
An application of crypto cloud computing in social networks by cooperative game theory
Sharing pollution permits under welfare upper bounds
Trouble comes in threes: core stability in minimum cost connection networks
On the core of cost-revenue games: minimum cost spanning tree games with revenues
Cooperative interval games: mountain situations with interval data
Congestion network problems and related games
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
Generalized minimum spanning tree games
Approximate stable solutions in infinite tree problems
On some approximately balanced combinatorial cooperative games
Minimal subsidies in expense sharing games
On the core and nucleolus of minimum cost spanning tree games
Noncooperative cost spanning tree games with budget restrictions
Minimum cost spanning tree games
The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games
Fair allocation on a network
Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
Proof of permutationally convexity of MCSF games
On analyzing cost allocation problems: cooperation building structures and order problem representations
Sharing the proceeds from a hierarchical venture
An efficient characterization of submodular spanning tree games
On Groves mechanisms for costly inclusion
Decentralized pricing in minimum cost spanning trees
Demand operators and the Dutta-Kar rule for minimum cost spanning tree problems
Algorithmic solutions for maximizing shareable costs
Fair tree connection games with topology-dependent edge cost
Lipschitz continuous allocations for optimization games
An allocation rule for connection scheduling problems
Comparative statics of minimum-cost-spanning-tree games
Axiomatization of the Shapley value on minimum cost spanning tree games
Sequential contributions rules for minimum cost spanning tree problems
Connection situations under uncertainty and cost monotonic solutions
On the core of network synthesis games
Optimal equilibria in the non-cooperative game associated with cost spanning tree problem
Communication and cooperation in public network situations
Fair cost-sharing methods for the minimum spanning tree game
Sharing a minimal cost spanning tree: beyond the folk solution
A note on maximizing the minimum voter satisfaction on spanning trees

This page was built for publication: Cost allocation for a spanning tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4105978)