Minimum cost spanning tree games and population monotonic allocation schemes.

DOI10.1016/S0377-2217(02)00714-2zbMath1099.90067OpenAlexW2043490811MaRDI QIDQ1420413

Stefano Moretti, Henk Norde, S. H. Tijs

Publication date: 2 February 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00714-2

zbMATH Keywords

decomposition theorem subtraction algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (44)

A monotonic and merge-proof rule in minimum cost spanning tree situations ⋮ Some new results on generalized additive games ⋮ Social enterprise tree network games ⋮ A note on Steiner tree games ⋮ A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations ⋮ Operations research games: A survey. (With comments and rejoinder) ⋮ Absence-proofness: group stability beyond the core ⋮ The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources ⋮ Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases ⋮ Decentralized pricing in minimum cost spanning trees ⋮ Characterization of monotonic rules in minimum cost spanning tree problems ⋮ Algorithms for computing the folk rule in minimum cost spanning tree problems with groups ⋮ An egalitarian solution to minimum cost spanning tree problems ⋮ A non-cooperative approach to the folk rule in minimum cost spanning tree problems ⋮ Obligation rules for minimum cost spanning tree situations and their monotonicity properties ⋮ The price of imperfect competition for a spanning network ⋮ On the existence of population-monotonic solutions on the domain of quasi-convex games ⋮ Linking the Kar and folk solutions through a problem separation property ⋮ ``Optimistic weighted Shapley rules in minimum cost spanning tree problems ⋮ Minimum cost arborescences ⋮ The degree and cost adjusted folk solution for minimum cost spanning tree games ⋮ Cost additive rules in minimum cost spanning tree problems with multiple sources ⋮ Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions ⋮ On the core of cost-revenue games: minimum cost spanning tree games with revenues ⋮ A characterization of kruskal sharing rules for minimum cost spanning tree problems ⋮ Minimum cost spanning tree problems with groups ⋮ The family of cost monotonic and cost additive rules in minimum cost spanning tree problems ⋮ Population monotonic allocation schemes for vertex cover games ⋮ Connection problems in mountains and monotonic allocation schemes. ⋮ The \(P\)-value for cost sharing in minimum ⋮ Merge-proofness in minimum cost spanning tree problems ⋮ Pricing traffic in a spanning network ⋮ On obligation rules for minimum cost spanning tree problems ⋮ Sharing a minimal cost spanning tree: beyond the folk solution ⋮ A generalization of obligation rules for minimum cost spanning tree problems ⋮ Approximate stable solutions in infinite tree problems ⋮ Additivity in minimum cost spanning tree problems ⋮ A new rule for source connection problems ⋮ A characterization of the folk rule for multi-source minimal cost spanning tree problems ⋮ Cost allocation protocols for supply contract design in network situations ⋮ On the population monotonicity of independent set games ⋮ The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources ⋮ COST SHARING IN NETWORKS: SOME OPEN QUESTIONS ⋮ CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS

Cites Work

This page was built for publication: Minimum cost spanning tree games and population monotonic allocation schemes.