The degree and cost adjusted folk solution for minimum cost spanning tree games
From MaRDI portal
Publication:1735782
DOI10.1016/J.GEB.2018.08.002zbMath1419.91159OpenAlexW3121895075WikidataQ129343664 ScholiaQ129343664MaRDI QIDQ1735782
Publication date: 29 March 2019
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://research.tilburguniversity.edu/en/publications/7ac3a323-f736-46a6-b568-c4c6d20cfe8c
Related Items (4)
Absence-proofness: group stability beyond the core ⋮ An egalitarian solution to minimum cost spanning tree problems ⋮ A non-cooperative game theory approach to cost sharing in networks ⋮ Cost-allocation problems for fuzzy agents in a fixed-tree network
Cites Work
- 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
- Axiomatization of the Shapley value on minimum cost spanning tree games
- Cost monotonicity, consistency and minimum cost spanning tree games
- Minimum cost connection networks: truth-telling and implementation
- On obligation rules for minimum cost spanning tree problems
- Sharing a minimal cost spanning tree: beyond the folk solution
- Population monotonic allocation schemes for cooperative games with transferable utility
- Minimum cost spanning tree games and population monotonic allocation schemes.
- Truth-telling and Nash equilibria in minimum cost spanning tree models
- The folk solution and Boruvka's algorithm in minimum cost spanning tree problems
- A fair rule in minimum cost spanning tree problems
- The \(P\)-value for cost sharing in minimum
- On the core and nucleolus of minimum cost spanning tree games
- Cost allocation for a spanning tree
- On cost allocation for a spanning tree: A game theoretic approach
This page was built for publication: The degree and cost adjusted folk solution for minimum cost spanning tree games
