Linking the Kar and folk solutions through a problem separation property

DOI10.1007/S00182-013-0407-5zbMATH Open1308.91042OpenAlexW2070069110MaRDI QIDQ480847FDOQ480847

Authors: 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

Recommendations

• The Kariya problem and related constructions
• scientific article; zbMATH DE number 1553133
• scientific article; zbMATH DE number 3904344
• Publication:4504560
• On a Solution Of Kesten’s Problem
• scientific article; zbMATH DE number 5994729
• An unified approach to the Fekete-Szegő problem
• A new approach to Kostant's problem
• On solution of the Kostyuchenko problem
• scientific article; zbMATH DE number 1560552

zbMATH Keywords

folk solutionKar solutionminimum cost spanning tree problemsproblem separability

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Sharing a minimal cost spanning tree: beyond the folk solution
• Obligation rules for minimum cost spanning tree situations and their monotonicity properties
• Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms
• A fair rule in minimum cost spanning tree problems
• 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
• Minimum cost spanning tree games and population monotonic allocation schemes.
• The \(P\)-value for cost sharing in minimum
• Characterizations of the Kar and folk solutions for minimum cost spanning tree problems
• Additivity in minimum cost spanning tree problems
• On obligation rules for minimum cost spanning tree problems
• The optimistic \(TU\) game in minimum cost spanning tree problems

Cited In (4)

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

This page was built for publication: Linking the Kar and folk solutions through a problem separation property

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