Sharing a minimal cost spanning tree: beyond the folk solution
From MaRDI portal
Recommendations
- \textit{Folk} solution for simple minimum cost spanning tree problems
- Minimum cost spanning tree problems as value sharing problems
- The degree and cost adjusted folk solution for minimum cost spanning tree games
- A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
- Characterizations of the Kar and folk solutions for minimum cost spanning tree problems
Cites work
- scientific article; zbMATH DE number 956794 (Why is no real title available?)
- A fair rule in minimum cost spanning tree problems
- Axiomatization of the Shapley value on minimum cost spanning tree games
- Cost allocation for a spanning tree
- Cost monotonicity, consistency and minimum cost spanning tree games
- Minimum cost spanning tree games and population monotonic allocation schemes.
- Obligation rules for minimum cost spanning tree situations and their monotonicity properties
- On cost allocation for a spanning tree: A game theoretic approach
- On the core and nucleolus of minimum cost spanning tree games
- Sharing the cost of a capacity network
- The \(P\)-value for cost sharing in minimum
- The bird core for minimum cost spanning tree problems revisited: monotonicity and additivity aspects
- The optimistic \(TU\) game in minimum cost spanning tree problems
Cited in
(52)- Demand operators and the Dutta-Kar rule for minimum cost spanning tree problems
- An egalitarian solution to minimum cost spanning tree problems
- The degree and cost adjusted folk solution for minimum cost spanning tree games
- Minimum cost spanning tree problems as value sharing problems
- The price of imperfect competition for a spanning network
- On obligation rules for minimum cost spanning tree problems
- Minimum incoming cost rules for arborescences
- Generalized minimum spanning tree games
- Finding socially best spanning treesî
- Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases
- The folk solution and Boruvka's algorithm in minimum cost spanning tree problems
- Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems
- A non-cooperative approach to the folk rule in minimum cost spanning tree problems
- On the set of extreme core allocations for minimal cost spanning tree problems
- Decentralized pricing in minimum cost spanning trees
- Cost sharing in networks: some open questions
- Sharing the cost of maximum quality optimal spanning trees
- Minimum cost spanning tree problems with indifferent agents
- Characterizations of the Kar and folk solutions for minimum cost spanning tree problems
- Minimum cost connection networks: truth-telling and implementation
- Minimum cost arborescences
- Clique games: a family of games with coincidence between the nucleolus and the Shapley value
- On games arising from multi-depot Chinese postman problems
- The folk rule for minimum cost spanning tree problems with multiple sources
- Sequential contributions rules for minimum cost spanning tree problems
- Knapsack cost sharing
- A note on maximizing the minimum voter satisfaction on spanning trees
- Fair cost-sharing methods for the minimum spanning tree game
- Trouble comes in threes: core stability in minimum cost connection networks
- Cost sharing solutions defined by non-negative eigenvectors
- A monotonic and merge-proof rule in minimum cost spanning tree situations
- Truth-telling and Nash equilibria in minimum cost spanning tree models
- Sharing the cost of a capacity network
- Cost additive rules in minimum cost spanning tree problems with multiple sources
- Axiomatization of the Shapley value on minimum cost spanning tree games
- An axiomatic approach in minimum cost spanning tree problems with groups
- Characterization of monotonic rules in minimum cost spanning tree problems
- Absence-proofness: group stability beyond the core
- A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
- On the core and nucleolus of directed acyclic graph games
- Maximizing the minimum voter satisfaction on spanning trees
- Strategic sharing of a costly network
- Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions
- Popular spanning trees
- Sharing the cost of risky projects
- Linking the Kar and folk solutions through a problem separation property
- A non-cooperative game theory approach to cost sharing in networks
- Cost allocation in asymmetric trees
- Investigation on irreducible cost vectors in minimum cost arborescence problems
- \textit{Folk} solution for simple minimum cost spanning tree problems
- Pricing traffic in a spanning network
- One-way and two-way cost allocation in hub network problems
This page was built for publication: Sharing a minimal cost spanning tree: beyond the folk solution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q980947)