Pages that link to "Item:Q2469848"
From MaRDI portal
The following pages link to A fair rule in minimum cost spanning tree problems (Q2469848):
Displayed 50 items.
- 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)
- A cost allocation rule for \(k\)-hop minimum cost spanning tree problems (Q433843) (← links)
- Weakly monotonic solutions for cooperative games (Q472188) (← links)
- Linking the Kar and folk solutions through a problem separation property (Q480847) (← links)
- Strategic sharing of a costly network (Q504401) (← links)
- Loss allocation in energy transmission networks (Q523466) (← 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)
- A characterization of kruskal sharing rules for minimum cost spanning tree problems (Q532655) (← links)
- Merge-proofness in minimum cost spanning tree problems (Q548071) (← 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)
- Connection situations under uncertainty and cost monotonic solutions (Q716360) (← links)
- A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations (Q845585) (← links)
- Fair cost-sharing methods for the minimum spanning tree game (Q845820) (← links)
- Characterization of monotonic rules in minimum cost spanning tree problems (Q891331) (← links)
- A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems (Q926221) (← links)
- Minimum cost spanning tree problems with groups (Q964464) (← links)
- The family of cost monotonic and cost additive rules in minimum cost spanning tree problems (Q964827) (← links)
- On obligation rules for minimum cost spanning tree problems (Q980946) (← links)
- Sharing a minimal cost spanning tree: beyond the folk solution (Q980947) (← links)
- Additivity in minimum cost spanning tree problems (Q999732) (← links)
- Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms (Q1038341) (← links)
- Sharing sequential values in a network (Q1622386) (← links)
- Minimum incoming cost rules for arborescences (Q1697835) (← links)
- Characterizing rules in minimum cost spanning tree problems (Q1728385) (← 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)
- Emerging markets in the global economic network: real(ly) decoupling? (Q1782571) (← links)
- Truth-telling and Nash equilibria in minimum cost spanning tree models (Q1926969) (← links)
- Hyperadditive games and applications to networks or matching problems (Q1995312) (← links)
- Pricing traffic in a spanning network (Q2016252) (← links)
- Clique games: a family of games with coincidence between the nucleolus and the Shapley value (Q2173166) (← links)
- Allocating costs in set covering problems (Q2178140) (← links)
- Allocating extra revenues from broadcasting sports leagues (Q2201702) (← links)
- Stability and fairness in the job scheduling problem (Q2273931) (← links)
- A generalization of obligation rules for minimum cost spanning tree problems (Q2275607) (← links)
- The folk solution and Boruvka's algorithm in minimum cost spanning tree problems (Q2275934) (← links)
- Stable cost sharing in production allocation games (Q2318129) (← links)
- A cost sharing example in which subsidies are necessary for stability (Q2334315) (← links)
- The folk rule through a painting procedure for minimum cost spanning tree problems with multiple sources (Q2334863) (← 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)
- A discrete cost sharing model with technological cooperation (Q2376076) (← links)
- On the set of extreme core allocations for minimal cost spanning tree problems (Q2397642) (← links)