Obligation rules for minimum cost spanning tree situations and their monotonicity properties
From MaRDI portal
Publication:2432840
DOI10.1016/j.ejor.2005.04.036zbMath1137.90361OpenAlexW3121841453MaRDI QIDQ2432840
Henk Norde, S. H. Tijs, Stefano Moretti, Rodica Branzei
Publication date: 25 October 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://basepub.dauphine.fr/handle/123456789/4876
cost allocationpopulation monotonic allocation schemescost monotonicityminimum cost spanning tree situations
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items (38)
Some new results on generalized additive games ⋮ Generalized minimum spanning tree games ⋮ Cost allocation in asymmetric trees ⋮ A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations ⋮ Absence-proofness: group stability beyond the core ⋮ The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources ⋮ Truth-telling and Nash equilibria in minimum cost spanning tree models ⋮ Characterization of monotonic rules in minimum cost spanning tree problems ⋮ Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems ⋮ Minimum cost connection networks: truth-telling and implementation ⋮ Algorithms for computing the folk rule in minimum cost spanning tree problems with groups ⋮ An egalitarian solution to minimum cost spanning tree problems ⋮ A new stable and more responsive cost sharing solution for minimum cost spanning tree problems ⋮ Minimum incoming cost rules for arborescences ⋮ Minimum cost spanning tree problems as value sharing problems ⋮ A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems ⋮ Characterizing rules in minimum cost spanning tree problems ⋮ Linking the Kar and folk solutions through a problem separation property ⋮ ``Optimistic weighted Shapley rules in minimum cost spanning tree problems ⋮ Cost additive rules in minimum cost spanning tree problems with multiple sources ⋮ Trouble comes in threes: core stability in minimum cost connection networks ⋮ Monotonicity in sharing the revenues from broadcasting sports leagues ⋮ Investigation on irreducible cost vectors in minimum cost arborescence problems ⋮ 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 ⋮ The family of cost monotonic and cost additive rules in minimum cost spanning tree problems ⋮ The \(P\)-value for cost sharing in minimum ⋮ On obligation rules for minimum cost spanning tree problems ⋮ Sharing a minimal cost spanning tree: beyond the folk solution ⋮ Connection situations under uncertainty and cost monotonic solutions ⋮ A generalization of obligation rules for minimum cost spanning tree problems ⋮ Approximate stable solutions in infinite 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 grey obligation rules ⋮ The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources ⋮ CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS
Cites Work
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Connection problems in mountains and monotonic allocation schemes.
- Cost monotonicity, consistency and minimum cost spanning tree games
- Population monotonic allocation schemes for cooperative games with transferable utility
- Minimum cost spanning tree games and population monotonic allocation schemes.
- The \(P\)-value for cost sharing in minimum
- Minimum cost spanning tree games
- On cost allocation for a spanning tree: A game theoretic approach
- Unnamed Item
- Unnamed Item
This page was built for publication: Obligation rules for minimum cost spanning tree situations and their monotonicity properties
