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

DOI10.1007/S00355-013-0759-6zbMath1302.91039OpenAlexW2005627431MaRDI QIDQ404757

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)

Related Items (1)

Characterization of monotonic rules in minimum cost spanning tree problems

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
• Linking the Kar and folk solutions through a problem separation property
• Axiomatization of the Shapley value on minimum cost spanning tree games
• Sharing a minimal cost spanning tree: beyond the folk solution
• Additivity in minimum cost spanning tree problems
• Obligation rules for minimum cost spanning tree situations and their monotonicity properties
• A fair rule in minimum cost spanning tree problems
• The \(P\)-value for cost sharing in minimum
• CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS
• On cost allocation for a spanning tree: A game theoretic approach

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