Merge-proofness in minimum cost spanning tree problems
From MaRDI portal
Publication:548071
DOI10.1007/S00182-010-0243-9zbMath1220.91012OpenAlexW1973090710MaRDI QIDQ548071
María 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
Related Items (7)
A monotonic and merge-proof rule in minimum cost spanning tree situations ⋮ Reassignment-proof rules for land rental problems ⋮ Truth-telling and Nash equilibria in minimum cost spanning tree models ⋮ Cooperative approach to a location problem with agglomeration economies ⋮ Pairwise mergers in bipartite matching games with an application in collaborative logistics ⋮ Minimum cost spanning tree problems with indifferent agents ⋮ CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS
Cites Work
- Axiomatization of the Shapley value on minimum cost spanning tree games
- Cost monotonicity, consistency and minimum cost spanning tree games
- A problem of rights arbitration from the Talmud
- Minimum cost spanning tree games and population monotonic allocation schemes.
- The folk solution and Boruvka's algorithm in minimum cost spanning tree problems
- ``Optimistic weighted Shapley rules in minimum cost spanning tree problems
- The optimistic \(TU\) game in minimum cost spanning tree problems
- A fair rule in minimum cost spanning tree problems
- The \(P\)-value for cost sharing in minimum
- A value for games with coalition structures
- The irreducible Core of a minimum cost spanning tree game
- On the core and nucleolus of minimum cost spanning tree games
- Minimum cost spanning tree games
- On cost allocation for a spanning tree: A game theoretic approach
- NULL PLAYERS OUT? LINEAR VALUES FOR GAMES WITH VARIABLE SUPPORTS
This page was built for publication: Merge-proofness in minimum cost spanning tree problems
