Minimum incoming cost rules for arborescences

DOI10.1007/S00355-017-1061-9zbMath1392.91102OpenAlexW2618557016MaRDI QIDQ1697835

Christian Trudeau, Eric Bahel

Publication date: 20 February 2018

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

Full work available at URL: https://doi.org/10.1007/s00355-017-1061-9

zbMATH Keywords

Dutta-Mishra solutionminimum cost arborescenceminimum incoming cost rules

Mathematics Subject Classification ID

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

Related Items (3)

Stable and weakly additive cost sharing in shortest path problems ⋮ Hyperadditive games and applications to networks or matching problems ⋮ Stability and fairness in the job scheduling problem

Cites Work

• Unnamed Item
• On the core and bargaining set of a veto game
• A new stable and more responsive cost sharing solution for minimum cost spanning tree problems
• Minimum cost arborescences
• 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
• Stable lexicographic rules for shortest path games
• Obligation rules for minimum cost spanning tree situations and their monotonicity properties
• A fair rule in minimum cost spanning tree problems
• CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS
• On cost allocation for a spanning tree: A game theoretic approach
• Optimum branchings

This page was built for publication: Minimum incoming cost rules for arborescences