Merge-proofness in minimum cost spanning tree problems
type: Item
instance of: scholarly article
title: Merge-proofness in minimum cost spanning tree problems
zbMATH Open document ID: 1220.91012
author: M. Gómez-Rúa
author: Juan J. Vidal-Puga
published in: International Journal of Game Theory
publication date: 2011-06-28T00:00:00Z
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 5913902
zbMATH Keywords: minimum cost spanning tree problems
zbMATH Keywords: cost sharing
zbMATH Keywords: Bird rule
zbMATH Keywords: merge-proofness
MaRDI profile type: Publication
full work available at URL: s00182-010-0243-9
OpenAlex ID: W1973090710
cites work: The irreducible Core of a minimum cost spanning tree game
cites work: ``Optimistic'' weighted Shapley rules in minimum cost spanning tree problems
cites work: The folk solution and Boruvka's algorithm in minimum cost spanning tree problems
cites work: A fair rule in minimum cost spanning tree problems
cites work: The optimistic \(TU\) game in minimum cost spanning tree problems
cites work: On cost allocation for a spanning tree: A game theoretic approach
cites work: The \(P\)-value for cost sharing in minimum
cites work: NULL PLAYERS OUT? LINEAR VALUES FOR GAMES WITH VARIABLE SUPPORTS
cites work: Cost monotonicity, consistency and minimum cost spanning tree games
cites work: Minimum cost spanning tree games
cites work: On the core and nucleolus of minimum cost spanning tree games
cites work: A value for games with coalition structures
cites work: Axiomatization of the Shapley value on minimum cost spanning tree games
cites work: Minimum cost spanning tree games and population monotonic allocation schemes.
cites work: A problem of rights arbitration from the Talmud
DOI: 10.1007/S00182-010-0243-9
description: scientific article; zbMATH DE number 5913902