Pages that link to "Item:Q3964354"

The following pages link to The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games (Q3964354):

Displayed 27 items.

• Axiomatization of the Shapley value on minimum cost spanning tree games (Q700116) ‎ (← links)
• Sequencing games with controllable processing times (Q818079) ‎ (← links)
• The minimum cost spanning forest game (Q899945) ‎ (← links)
• \(p\)-additive games: a class of totally balanced games arising from inventory situations with temporary discounts (Q926590) ‎ (← links)
• Network flow problems and permutationally concave games (Q1042338) ‎ (← links)
• Communication and its cost in graph-restricted games (Q1107455) ‎ (← links)
• Monotonicity of solutions in certain dynamic cooperative games (Q1173753) ‎ (← links)
• A note on the permutationally convex games (Q1174811) ‎ (← links)
• A necessary and sufficient condition for the convexity in oligopoly games (Q1296504) ‎ (← links)
• Operations research games: A survey. (With comments and rejoinder) (Q1348703) ‎ (← links)
• On the complexity of testing membership in the core of min-cost spanning tree games (Q1365002) ‎ (← links)
• Minimum cost forest games (Q1365003) ‎ (← links)
• Inventory games. (Q1426696) ‎ (← links)
• Three-person spanning tree games (Q1596863) ‎ (← links)
• Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases (Q1926641) ‎ (← links)
• The average tree solution for cooperative games with communication structure (Q2268115) ‎ (← links)
• The socially stable core in structured transferable utility games (Q2371152) ‎ (← links)
• Component efficient solutions in line-graph games with applications (Q2385112) ‎ (← links)
• A core-allocation family for generalized holding cost games (Q2460041) ‎ (← links)
• The average tree solution for cycle-free graph games (Q2483116) ‎ (← links)
• COLLECTING INFORMATION TO IMPROVE DECISION-MAKING (Q2762237) ‎ (← links)
• CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS (Q2854002) ‎ (← links)
• The irreducible Core of a minimum cost spanning tree game (Q3142157) ‎ (← links)
• On the core and nucleolus of minimum cost spanning tree games (Q3329250) ‎ (← links)
• Proof of permutationally convexity of MCSF games (Q4296297) ‎ (← links)
• A bankruptcy problem and an information trading problem: Applications tok-convex games (Q4845142) ‎ (← links)
• An efficient characterization of submodular spanning tree games (Q5918917) ‎ (← links)