Additivity in minimum cost spanning tree problems
From MaRDI portal
Publication:999732
DOI10.1016/J.JMATECO.2008.03.003zbMATH Open1154.91357OpenAlexW2165336189MaRDI QIDQ999732FDOQ999732
G. Bergantiños, Juan J. Vidal-Puga
Publication date: 10 February 2009
Published in: Journal of Mathematical Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmateco.2008.03.003
Recommendations
- Cost additive rules in minimum cost spanning tree problems with multiple sources
- The family of cost monotonic and cost additive rules in minimum cost spanning tree problems
- Additive Tree Spanners
- scientific article; zbMATH DE number 540118
- Sequential contributions rules for minimum cost spanning tree problems
- The bird core for minimum cost spanning tree problems revisited: monotonicity and additivity aspects
- Characterizing rules in minimum cost spanning tree problems
- On the simultaneous minimum spanning trees problem
- Approximating minimum-cost graph problems with spanning tree edges
- A generalization of the minimum branch vertices spanning tree problem
Applications of graph theory (05C90) Programming involving graphs or networks (90C35) Games involving graphs (91A43)
Cites Work
- Title not available (Why is that?)
- Minimum cost spanning tree games
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
- Cost monotonicity, consistency and minimum cost spanning tree games
- A fair rule in minimum cost spanning tree problems
- Minimum cost spanning tree games and population monotonic allocation schemes.
- Spanning network games.
- The \(P\)-value for cost sharing in minimum
- The optimistic \(TU\) game in minimum cost spanning tree problems
- A non-cooperative approach to the cost spanning tree problem.
- Optimal equilibria in the non-cooperative game associated with cost spanning tree problem
Cited In (27)
- Algorithms for computing the folk rule in minimum cost spanning tree problems with groups
- A characterization of kruskal sharing rules for minimum cost spanning tree problems
- Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems
- Stable and weakly additive cost sharing in shortest path problems
- Linking the Kar and folk solutions through a problem separation property
- A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations
- Cost sharing in networks: some open questions
- An FPT Algorithm for Minimum Additive Spanner Problem.
- The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources
- A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
- Title not available (Why is that?)
- Minimum cost spanning tree problems with groups
- Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms
- On obligation rules for minimum cost spanning tree problems
- The family of cost monotonic and cost additive rules in minimum cost spanning tree problems
- The folk solution and Boruvka's algorithm in minimum cost spanning tree problems
- A monotonic and merge-proof rule in minimum cost spanning tree situations
- Cost additive rules in minimum cost spanning tree problems with multiple sources
- The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources
- Characterization of monotonic rules in minimum cost spanning tree problems
- Characterizations of the Kar and folk solutions for minimum cost spanning tree problems
- Truth-telling and Nash equilibria in minimum cost spanning tree models
- An axiomatic approach in minimum cost spanning tree problems with groups
- A generalization of obligation rules for minimum cost spanning tree problems
- Minimum incoming cost rules for arborescences
- A new rule for source connection problems
- Minimum cost spanning tree problems as value sharing problems
This page was built for publication: Additivity in minimum cost spanning tree problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q999732)