Recommendations
Cites work
- scientific article; zbMATH DE number 9246 (Why is no real title available?)
- scientific article; zbMATH DE number 3580570 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A dual ascent approach for steiner tree problems on a directed graph
- A generalized linear production model: A unifying model
- An Application of Generalized Linear Programming to Network Flows
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
- Cost allocation for a spanning tree
- Cost allocation for steiner trees
- Generalized Network Problems Yielding Totally Balanced Games
- Minimum cost spanning tree games
- On cost allocation for a spanning tree: A game theoretic approach
- On cost allocation in communication networks
- On the core and nucleolus of minimum cost spanning tree games
- On the core of a traveling salesman cost allocation game
- On the core of linear production games
- Optimum branchings
- Packing rooted directed cuts in a weighted directed graph
- Synthesis of a Communication Network
- The assignment game. I: The core
- The ellipsoid method and its consequences in combinatorial optimization
- The kernel and bargaining set for convex games
- Totally Balanced Games and Games of Flow
- Traveling salesman games
Cited in
(32)- On the core of a traveling salesman cost allocation game
- A core-allocation for a network restricted linear production game
- A cooperative location game based on the 1-center location problem
- Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
- A note on Steiner tree games
- Efficient black-box reductions for separable cost sharing
- Efficient black-box reductions for separable cost sharing
- Extended cooperative networks games
- Averaged dual solution for linear production games and its characterization
- Minimum cost forest games
- Cost sharing in networks: some open questions
- Strategic cooperation in cost sharing games
- On approximately fair cost allocation in Euclidean TSP games
- Social enterprise tree network games
- On the core of the minimum cost Steiner tree game in networks
- Minimum cost connection networks: truth-telling and implementation
- A cost-sharing method for an economic lot-sizing game
- Tarification par des jeux Coopératifs avec Demandes Élastiques
- On the complexity of testing membership in the core of min-cost spanning tree games
- Access network synthesis game in next generation networks
- A compact linear program for testing optimality of perfect matchings.
- Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner
- Cooperative networks games with elastic demands
- Trouble comes in threes: core stability in minimum cost connection networks
- Stochastic linear programming games with concave preferences
- On some approximately balanced combinatorial cooperative games
- Efficient computation of the Shapley value for large-scale linear production games
- LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES
- Dynamic linear programming games with risk-averse players
- The complexity of egalitarian mechanisms for linear programming games
- A non-cooperative game theory approach to cost sharing in networks
- Pricing traffic in a spanning network
This page was built for publication: On the core of network synthesis games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757264)
