Pages that link to "Item:Q980947"

The following pages link to Sharing a minimal cost spanning tree: beyond the folk solution (Q980947):

Displaying 46 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)
• 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)
• Sharing the cost of maximum quality optimal spanning trees (Q1979176) (← links)
• Pricing traffic in a spanning network (Q2016252) (← links)
• A non-cooperative game theory approach to cost sharing in networks (Q2067258) (← links)
• Clique games: a family of games with coincidence between the nucleolus and the Shapley value (Q2173166) (← links)
• One-way and two-way cost allocation in hub network problems (Q2178916) (← links)
• Cost additive rules in minimum cost spanning tree problems with multiple sources (Q2241238) (← links)
• Trouble comes in threes: core stability in minimum cost connection networks (Q2242222) (← links)
• Knapsack cost sharing (Q2254240) (← links)
• An axiomatic approach in minimum cost spanning tree problems with groups (Q2348765) (← links)
• A monotonic and merge-proof rule in minimum cost spanning tree situations (Q2358794) (← links)
• On the set of extreme core allocations for minimal cost spanning tree problems (Q2397642) (← links)
• Finding socially best spanning treesî (Q2430005) (← links)
• The price of imperfect competition for a spanning network (Q2436294) (← links)
• Minimum cost spanning tree problems as value sharing problems (Q2689423) (← 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)
• The Folk Rule for Minimum Cost Spanning Tree Problems with Multiple Sources (Q5072241) (← links)
• POPULAR SPANNING TREES (Q5404516) (← links)
• An egalitarian solution to minimum cost spanning tree problems (Q6146788) (← links)
• A non-cooperative approach to the folk rule in minimum cost spanning tree problems (Q6164740) (← links)
• Demand operators and the Dutta-Kar rule for minimum cost spanning tree problems (Q6590144) (← links)