Pages that link to "Item:Q980947"
From MaRDI portal
The following pages link to Sharing a minimal cost spanning tree: beyond the folk solution (Q980947):
Displaying 23 items.
- On games arising from multi-depot Chinese postman problems (Q256685) (← links)
- Generalized minimum spanning tree games (Q286691) (← links)
- Cost allocation in asymmetric trees (Q296616) (← links)
- Absence-proofness: group stability beyond the core (Q328552) (← links)
- Characterizations of the cycle-complete and folk solutions for minimum cost spanning tree problems (Q404757) (← links)
- A new stable and more responsive cost sharing solution for minimum cost spanning tree problems (Q417711) (← links)
- Linking the Kar and folk solutions through a problem separation property (Q480847) (← links)
- Strategic sharing of a costly network (Q504401) (← links)
- On the core and nucleolus of directed acyclic graph games (Q526836) (← links)
- Efficient algorithms for subdominant cycle-complete cost functions and cycle-complete solutions (Q528547) (← links)
- Decentralized pricing in minimum cost spanning trees (Q612004) (← links)
- Minimum cost arborescences (Q665084) (← links)
- Sequential contributions rules for minimum cost spanning tree problems (Q712474) (← links)
- Maximizing the minimum voter satisfaction on spanning trees (Q732928) (← links)
- Characterization of monotonic rules in minimum cost spanning tree problems (Q891331) (← links)
- Minimum cost connection networks: truth-telling and implementation (Q894009) (← links)
- On obligation rules for minimum cost spanning tree problems (Q980946) (← links)
- A note on maximizing the minimum voter satisfaction on spanning trees (Q991324) (← links)
- Sharing the cost of risky projects (Q1640585) (← links)
- Minimum incoming cost rules for arborescences (Q1697835) (← links)
- The degree and cost adjusted folk solution for minimum cost spanning tree games (Q1735782) (← links)
- Investigation on irreducible cost vectors in minimum cost arborescence problems (Q1753571) (← links)
- \textit{Folk} solution for simple minimum cost spanning tree problems (Q1755817) (← links)
