Minimum cost spanning tree games
From MaRDI portal
Publication:3911709
DOI10.1007/BF01584227zbMath0461.90099MaRDI QIDQ3911709
Publication date: 1981
Published in: Mathematical Programming (Search for Journal in Brave)
cost allocationcooperative gamenucleoluscharacteristic function formminimum cost spanning tree gamesnonemptiness theoremefficient coalition structures
Cooperative games (91A12) Applications of game theory (91A80) Other game-theoretic models (91A40) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (only showing first 100 items - show all)
Proof of permutationally convexity of MCSF games ⋮ Approximate core allocations for edge cover games ⋮ Averaged dual solution for linear production games and its characterization ⋮ A non-cooperative approach to the folk rule in minimum cost spanning tree problems ⋮ Unnamed Item ⋮ Spanning-Tree Games. ⋮ An efficient characterization of submodular spanning tree games ⋮ Comments on: cooperative games and cost allocation problems ⋮ Efficient Black-Box Reductions for Separable Cost Sharing ⋮ Potential Games Are Necessary to Ensure Pure Nash Equilibria in Cost Sharing Games ⋮ The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games ⋮ A core-allocation for a network restricted linear production game ⋮ Multi-criteria minimum cost spanning tree games ⋮ Social enterprise tree network games ⋮ Minimal Subsidies in Expense Sharing Games ⋮ On the core of information graph games ⋮ Monotonic games are spanning network games ⋮ A note on Steiner tree games ⋮ Generalized minimum spanning tree games ⋮ A cost allocation problem arising in hub-spoke network systems ⋮ A vertex oriented approach to the equal remaining obligations rule for minimum cost spanning tree situations ⋮ Operations research games: A survey. (With comments and rejoinder) ⋮ Fair cost-sharing methods for the minimum spanning tree game ⋮ Stochastic linear programming games with concave preferences ⋮ On the core of the minimum cost Steiner tree game in networks ⋮ New techniques for cost sharing in combinatorial optimization games ⋮ Monotonicity of the core and value in dynamic cooperative games ⋮ On the core of routing games ⋮ Values for cooperative games over graphs and games with inadmissible coalitions ⋮ Communication and its cost in graph-restricted games ⋮ Sharing the cost of multicast transmissions in wireless networks ⋮ On the complexity of testing membership in the core of min-cost spanning tree games ⋮ Minimum cost forest games ⋮ On the set of extreme core allocations for minimal cost spanning tree problems ⋮ Highway games on weakly cyclic graphs ⋮ Proof systems and transformation games ⋮ A generalized linear production model: A unifying model ⋮ The kernel/nucleolus of a standard tree game ⋮ Tree enterprises and bankruptcy ventures. A game theoretic similarity due to a graph theoretic proof ⋮ On the core of a traveling salesman cost allocation game ⋮ Efficient computation of the Shapley value for large-scale linear production games ⋮ On approximately fair cost allocation in Euclidean TSP games ⋮ Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases ⋮ Unnamed Item ⋮ Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner ⋮ Characterization of monotonic rules in minimum cost spanning tree problems ⋮ Strategic cooperation in cost sharing games ⋮ The minimum cost spanning forest game ⋮ Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation ⋮ Assignment markets that are uniquely determined by their core ⋮ Cooperative location games based on the minimum diameter spanning Steiner subgraph problem ⋮ Obligation rules for minimum cost spanning tree situations and their monotonicity properties ⋮ Minimum cost spanning tree games and population monotonic allocation schemes. ⋮ Approximating the least core value and least core of cooperative games with supermodular costs ⋮ A characterization of optimistic weighted Shapley rules in minimum cost spanning tree problems ⋮ Approximately fair cost allocation in metric traveling salesman games ⋮ On the submodularity of multi-depot traveling salesman games ⋮ The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game ⋮ Cooperative games arising from network flow problems ⋮ ``Optimistic weighted Shapley rules in minimum cost spanning tree problems ⋮ The optimistic \(TU\) game in minimum cost spanning tree problems ⋮ Traveling salesman games ⋮ Strategic sharing of a costly network ⋮ Trouble comes in threes: core stability in minimum cost connection networks ⋮ A fair rule in minimum cost spanning tree problems ⋮ The travelling preacher, projection, and a lower bound for the stability number of a graph ⋮ Supportability of network cost functions ⋮ LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES ⋮ Dynamic linear programming games with risk-averse players ⋮ On the core and nucleolus of directed acyclic graph games ⋮ On the core of cost-revenue games: minimum cost spanning tree games with revenues ⋮ A characterization of kruskal sharing rules for minimum cost spanning tree problems ⋮ On the core and nucleolus of minimum cost spanning tree games ⋮ The minimum cost shortest-path tree game ⋮ Assignment games satisfy the CoMa-property ⋮ Axiomatization of the Shapley value on minimum cost spanning tree games ⋮ The \(P\)-value for cost sharing in minimum ⋮ Merge-proofness in minimum cost spanning tree problems ⋮ Congestion network problems and related games ⋮ Cost monotonicity, consistency and minimum cost spanning tree games ⋮ A generalization of obligation rules for minimum cost spanning tree problems ⋮ A cooperative location game based on the 1-center location problem ⋮ Approximate stable solutions in infinite tree problems ⋮ Additivity in minimum cost spanning tree problems ⋮ A new rule for source connection problems ⋮ Compromise values in cooperative game theory ⋮ Total balancedness condition for Steiner tree games. ⋮ Cost allocation in spanning network enterprises with stochastic connection costs. ⋮ On the core of network synthesis games ⋮ On the concavity of delivery games ⋮ Traveling salesman games with the Monge property ⋮ Stable cores in information graph games ⋮ Opportune moment strategies for a cost spanning tree game ⋮ A survey on networking games in telecommunications ⋮ OPEN PROBLEMS IN COOPERATIVE LOCATION GAMES ⋮ COST SHARING IN NETWORKS: SOME OPEN QUESTIONS ⋮ CHARACTERIZATIONS OF THE KAR AND FOLK SOLUTIONS FOR MINIMUM COST SPANNING TREE PROBLEMS ⋮ Permutation games: Another class of totally balanced games ⋮ Cost allocation in the Chinese postman problem ⋮ Three-person spanning tree games
Cites Work
This page was built for publication: Minimum cost spanning tree games
