Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems

DOI10.1007/S00355-013-0759-6MaRDI QIDQ404757zbMATH OpenOpenAlexFDO

Authors Christian Trudeau

Publication date 4 September 2014

Published in Social Choice and Welfare (Search for Journal in Brave)

Full work available at URL http://web2.uwindsor.ca/economics/RePEc/wis/pdf/1303.pdf

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Cooperative games (91A12) Games involving graphs (91A43)

Recommendations

• Characterizations of the Kar and folk solutions for minimum cost spanning tree problems
• Minimum cost spanning tree problems as value sharing problems
• \textit{Folk} solution for simple minimum cost spanning tree problems
• Sharing a minimal cost spanning tree: beyond the folk solution
• Linking the Kar and folk solutions through a problem separation property

Cites work

• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• A fair rule in minimum cost spanning tree problems
• A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
• Additivity in minimum cost spanning tree problems
• Axiomatization of the Shapley value on minimum cost spanning tree games
• Characterizations of the Kar and folk solutions for minimum cost spanning tree problems
• Linking the Kar and folk solutions through a problem separation property
• Obligation rules for minimum cost spanning tree situations and their monotonicity properties
• On cost allocation for a spanning tree: A game theoretic approach
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Sharing a minimal cost spanning tree: beyond the folk solution
• The P-value for cost sharing in minimum

Cited in

(12)

• Algorithms for computing the folk rule in minimum cost spanning tree problems with groups
• scientific article; zbMATH DE number 447202 (Why is no real title available?)
• Anonymity in sharing the revenues from broadcasting sports leagues
• An egalitarian solution to minimum cost spanning tree problems
• Demand operators and the Dutta-Kar rule for minimum cost spanning tree problems
• 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
• Characterization of monotonic rules in minimum cost spanning tree problems
• Characterizations of the Kar and folk solutions for minimum cost spanning tree problems
• The degree and cost adjusted folk solution for minimum cost spanning tree games
• Minimum cost spanning tree problems with indifferent agents
• Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions

This page was built for publication: Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404757)