A non-cooperative approach to the folk rule in minimum cost spanning tree problems
From MaRDI portal
Publication:6164740
Recommendations
- A characterization of the folk rule for multi-source minimal cost spanning tree problems
- A non-cooperative approach to the cost spanning tree problem.
- The folk rule for minimum cost spanning tree problems with multiple sources
- A fair rule in minimum cost spanning tree problems
- Algorithms for computing the folk rule in minimum cost spanning tree problems with groups
- The folk solution and Boruvka's algorithm in minimum cost spanning tree problems
- The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources
- Characterizing rules in minimum cost spanning tree problems
- Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms
- \textit{Folk} solution for simple minimum cost spanning tree problems
Cites work
- A fair rule in minimum cost spanning tree problems
- Axiomatization of the Shapley value on minimum cost spanning tree games
- Clique games: a family of games with coincidence between the nucleolus and the Shapley value
- Game theory. Translated from the Hebrew by Ziv Hellman and edited by Mike Borns
- Minimum cost arborescences
- Minimum cost spanning tree games
- Minimum cost spanning tree games and population monotonic allocation schemes.
- On cost allocation for a spanning tree: A game theoretic approach
- On the core and nucleolus of directed acyclic graph games
- On the core and nucleolus of minimum cost spanning tree games
- Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms
- Sharing a minimal cost spanning tree: beyond the folk solution
- Simple subscription mechanisms for excludable public goods
- Strategic sharing of a costly network
- Submodularity of minimum-cost spanning tree games
- Subscription mechanisms for network formation.
- The optimistic TU game in minimum cost spanning tree problems
- The price of imperfect competition for a spanning network
- Truth-telling and Nash equilibria in minimum cost spanning tree models
- Two-Person Cooperative Games
Cited in
(4)- Algorithms for computing the folk rule in minimum cost spanning tree problems with groups
- The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources
- Two-stage Minimum Cost Spanning Tree Game under Fuzzy Optimistic Coalition
- A fair rule in minimum cost spanning tree problems
This page was built for publication: A non-cooperative approach to the folk rule in minimum cost spanning tree problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6164740)