Merge-proofness in minimum cost spanning tree problems

DOI10.1007/S00182-010-0243-9MaRDI QIDQ548071zbMATHOpenAlexFDO

Authors M. Gómez-Rúa, Juan J. Vidal-Puga

Publication date 28 June 2011

Published in International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00182-010-0243-9

zbMATH Keywords

cost sharingminimum cost spanning tree problemsBird rulemerge-proofness

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Games involving graphs (91A43)

Recommendations

• A monotonic and merge-proof rule in minimum cost spanning tree situations
• A fair rule in minimum cost spanning tree problems
• Cost monotonicity, consistency and minimum cost spanning tree games
• Additivity in minimum cost spanning tree problems
• Sequential contributions rules for minimum cost spanning tree problems

Cites work

• A fair rule in minimum cost spanning tree problems
• A problem of rights arbitration from the Talmud
• A value for games with coalition structures
• Axiomatization of the Shapley value on minimum cost spanning tree games
• Cost monotonicity, consistency and minimum cost spanning tree games
• Minimum cost spanning tree games
• Minimum cost spanning tree games and population monotonic allocation schemes.
• NULL PLAYERS OUT? LINEAR VALUES FOR GAMES WITH VARIABLE SUPPORTS
• On cost allocation for a spanning tree: A game theoretic approach
• On the core and nucleolus of minimum cost spanning tree games
• The \(P\)-value for cost sharing in minimum
• The folk solution and Boruvka's algorithm in minimum cost spanning tree problems
• The irreducible Core of a minimum cost spanning tree game
• The optimistic \(TU\) game in minimum cost spanning tree problems
• ``Optimistic weighted Shapley rules in minimum cost spanning tree problems

Cited in

(10)

• Algorithmic solutions for maximizing shareable costs
• Reassignment-proof rules for land rental problems
• Cooperative approach to a location problem with agglomeration economies
• Minimum cost spanning tree problems with indifferent agents
• Characterizations of the Kar and folk solutions for minimum cost spanning tree problems
• Notes on the Distributed Computation of Merge Trees on CW-Complexes
• Pairwise mergers in bipartite matching games with an application in collaborative logistics
• Reaching the bound in the \((2,n)\) merging problem
• A monotonic and merge-proof rule in minimum cost spanning tree situations
• Truth-telling and Nash equilibria in minimum cost spanning tree models

This page was built for publication: Merge-proofness 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 Q548071)