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):
Displayed 18 items.
- 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)
- 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)
- On obligation rules for minimum cost spanning tree problems (Q980946) (← links)
- A note on maximizing the minimum voter satisfaction on spanning trees (Q991324) (← links)
- Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases (Q1926641) (← links)
- Truth-telling and Nash equilibria in minimum cost spanning tree models (Q1926969) (← links)
- Pricing traffic in a spanning network (Q2016252) (← links)
- Knapsack cost sharing (Q2254240) (← links)
- Finding socially best spanning treesî (Q2430005) (← links)
- The price of imperfect competition for a spanning network (Q2436294) (← links)
- COST SHARING IN NETWORKS: SOME OPEN QUESTIONS (Q2854000) (← links)
- CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS (Q2854002) (← links)
- POPULAR SPANNING TREES (Q5404516) (← links)