A fair rule in minimum cost spanning tree problems

DOI10.1016/J.JET.2006.11.001MaRDI QIDQ2469848zbMATH OpenOpenAlexFDO

Authors G. Bergantiños, Juan J. Vidal-Puga

Publication date 11 February 2008

Published in Journal of Economic Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jet.2006.11.001

zbMATH Keywords

monotonicitycost allocationspanning tree

Mathematics Subject Classification ID

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

Recommendations

• Characterizing rules in minimum cost spanning tree problems
• The folk rule for minimum cost spanning tree problems with multiple sources
• Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms
• Fair cost-sharing methods for the minimum spanning tree game
• On obligation rules for minimum cost spanning tree problems
• A non-cooperative approach to the folk rule in minimum cost spanning tree problems
• A generalization of obligation rules for minimum cost spanning tree problems
• A characterization of the folk rule for multi-source minimal cost spanning tree problems
• A cost allocation rule for \(k\)-hop minimum cost spanning tree problems
• A characterization of kruskal sharing rules for minimum cost spanning tree problems

Cites work

• scientific article; zbMATH DE number 956794 (Why is no real title available?)
• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• A non-cooperative approach to the cost spanning tree problem.
• Axiomatization of the Shapley value on minimum cost spanning tree games
• Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
• Cost monotonicity, consistency and minimum cost spanning tree games
• Minimum cost spanning tree games
• Monotonic solutions of cooperative games
• On cost allocation for a spanning tree: A game theoretic approach
• On the core and nucleolus of minimum cost spanning tree games
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Spanning network games.
• The P-value for cost sharing in minimum
• The irreducible Core of a minimum cost spanning tree game

Cited in

(77)

• Allocating costs in set covering problems
• Broadcasting revenue sharing after cancelling sports competitions
• The P-value for cost sharing in minimum
• The folk rule for minimum cost spanning tree problems with multiple sources
• A characterization of kruskal sharing rules for minimum cost spanning tree problems
• A value for \(PERT\) problems
• Hyperadditive games and applications to networks or matching problems
• Algorithms for computing the folk rule in minimum cost spanning tree problems with groups
• Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems
• Stable cost sharing in production allocation games
• Linking the Kar and folk solutions through a problem separation property
• Merge-proofness in minimum cost spanning tree problems
• Stable and weakly additive cost sharing in shortest path problems
• Stability and fairness in the job scheduling problem
• Sharing sequential values in a network
• A cost sharing example in which subsidies are necessary for stability
• A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations
• Fair cost-sharing methods for the minimum spanning tree game
• Sharing a minimal cost spanning tree: beyond the folk solution
• An egalitarian solution to minimum cost spanning tree problems
• Cost sharing in networks: some open questions
• Additivity in minimum cost spanning tree problems
• Sequential contributions rules for minimum cost spanning tree problems
• Allocating extra revenues from broadcasting sports leagues
• Monotonicity in sharing the revenues from broadcasting sports leagues
• Trouble comes in threes: core stability in minimum cost connection networks
• Demand operators and the Dutta-Kar rule for minimum cost spanning tree problems
• Investigation on irreducible cost vectors in minimum cost arborescence problems
• \textit{Folk} solution for simple minimum cost spanning tree problems
• Cost allocation in asymmetric trees
• The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources
• A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
• A cost allocation rule for \(k\)-hop minimum cost spanning tree problems
• Cost monotonicity, consistency and minimum cost spanning tree games
• Minimum cost arborescences
• Connection situations under uncertainty and cost monotonic solutions
• Clique games: a family of games with coincidence between the nucleolus and the Shapley value
• Revenue sharing in airline alliance networks
• Minimum cost spanning tree problems with groups
• Characterizing rules in minimum cost spanning tree problems
• Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms
• A characterization of the folk rule for multi-source minimal cost spanning tree problems
• On obligation rules for minimum cost spanning tree problems
• Decentralized pricing in minimum cost spanning trees
• Absence-proofness: group stability beyond the core
• The family of cost monotonic and cost additive rules in minimum cost spanning tree problems
• Emerging markets in the global economic network: real(ly) decoupling?
• The folk solution and Boruvka's algorithm in minimum cost spanning tree problems
• Weakly monotonic solutions for cooperative games
• A monotonic and merge-proof rule in minimum cost spanning tree situations
• Cost additive rules in minimum cost spanning tree problems with multiple sources
• Characterization of monotonic rules in minimum cost spanning tree problems
• A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems
• Cost allocation and airport problems
• Characterizations of the Kar and folk solutions for minimum cost spanning tree problems
• Truth-telling and Nash equilibria in minimum cost spanning tree models
• An axiomatic approach in minimum cost spanning tree problems with groups
• The price of imperfect competition for a spanning network
• A generalization of obligation rules for minimum cost spanning tree problems
• Sharing the cost of maximum quality optimal spanning trees
• Strategic sharing of a costly network
• A discrete cost sharing model with technological cooperation
• Pricing traffic in a spanning network
• The degree and cost adjusted folk solution for minimum cost spanning tree games
• Minimum incoming cost rules for arborescences
• ``Optimistic weighted Shapley rules in minimum cost spanning tree problems
• A new rule for source connection problems
• A non-cooperative approach to the folk rule in minimum cost spanning tree problems
• On the set of extreme core allocations for minimal cost spanning tree problems
• Moving average rule for minimum cost spanning tree games
• Minimum cost spanning tree problems with indifferent agents
• The optimistic TU game in minimum cost spanning tree problems
• Cost-allocation problems for fuzzy agents in a fixed-tree network
• Minimum cost spanning tree problems as value sharing problems
• Loss allocation in energy transmission networks
• On the core and nucleolus of directed acyclic graph games
• Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions

This page was built for publication: A fair rule 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 Q2469848)