Linking the Kar and folk solutions through a problem separation property

DOI10.1007/s00182-013-0407-5zbMath1308.91042OpenAlexW2070069110MaRDI QIDQ480847

Christian Trudeau

Publication date: 12 December 2014

Published in: International Journal of Game Theory (Search for Journal in Brave)

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

zbMATH Keywords

folk solutionKar solutionminimum cost spanning tree problemsproblem separability

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43)

Related Items

Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems ⋮ A new stable and more responsive cost sharing solution for minimum cost spanning tree problems ⋮ Stability and fairness in the job scheduling problem

Cites Work

• Unnamed Item
• Unnamed Item
• A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
• Axiomatization of the Shapley value on minimum cost spanning tree games
• On obligation rules for minimum cost spanning tree problems
• Sharing a minimal cost spanning tree: beyond the folk solution
• Additivity in minimum cost spanning tree problems
• Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms
• Minimum cost spanning tree games and population monotonic allocation schemes.
• Obligation rules for minimum cost spanning tree situations and their monotonicity properties
• The optimistic \(TU\) game in minimum cost spanning tree problems
• 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