Pages that link to "Item:Q4133451"

The following pages link to On cost allocation for a spanning tree: A game theoretic approach (Q4133451):

Displaying 50 items.

• A core-allocation for a network restricted linear production game (Q271964) (← 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)
• Cooperative location games based on the minimum diameter spanning Steiner subgraph problem (Q423895) (← links)
• A cost allocation rule for \(k\)-hop minimum cost spanning tree problems (Q433843) (← links)
• The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game (Q477339) (← links)
• Strategic sharing of a costly network (Q504401) (← links)
• Sharing the proceeds from a hierarchical venture (Q523467) (← 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)
• The truncated core for games with upper bounds (Q532762) (← 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)
• Connection problems in mountains and monotonic allocation schemes. (Q699516) (← links)
• Axiomatization of the Shapley value on minimum cost spanning tree games (Q700116) (← links)
• Cost monotonicity, consistency and minimum cost spanning tree games (Q705853) (← links)
• Sequential contributions rules for minimum cost spanning tree problems (Q712474) (← links)
• Connection situations under uncertainty and cost monotonic solutions (Q716360) (← links)
• Maximizing the minimum voter satisfaction on spanning trees (Q732928) (← links)
• On the core of network synthesis games (Q757264) (← links)
• Optimal equilibria in the non-cooperative game associated with cost spanning tree problem (Q816509) (← 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)
• Sharing the cost of multicast transmissions in wireless networks (Q861267) (← links)
• Characterization of monotonic rules in minimum cost spanning tree problems (Q891331) (← links)
• The minimum cost spanning forest game (Q899945) (← links)
• A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems (Q926221) (← links)
• Approximately fair cost allocation in metric traveling salesman games (Q927408) (← 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)
• A note on maximizing the minimum voter satisfaction on spanning trees (Q991324) (← links)
• Cost allocation protocols for supply contract design in network situations (Q1014299) (← links)
• Extended cooperative networks games (Q1028468) (← links)
• Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms (Q1038341) (← links)
• Network flow problems and permutationally concave games (Q1042338) (← links)
• Opportune moment strategies for a cost spanning tree game (Q1044215) (← links)
• Communication and its cost in graph-restricted games (Q1107455) (← links)
• Monotonicity of solutions in certain dynamic cooperative games (Q1173753) (← links)
• Cooperative games arising from network flow problems (Q1178645) (← links)
• Supportability of network cost functions (Q1197768) (← links)
• An integrated evaluation of facility location, capacity aquisition, and technology selection for designing global manufacturing strategies (Q1198290) (← links)
• Cost allocation in the Chinese postman problem (Q1307816) (← links)
• Algorithms for real-time scheduling of jobs on mixed model assembly lines (Q1321799) (← links)