On the core of network synthesis games
DOI10.1007/BF01594930zbMATH Open0722.90091OpenAlexW2060444450MaRDI QIDQ757264FDOQ757264
Publication date: 1991
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01594930
corelinear production gameminimum cost spanning tree gamenetwork design cooperative gamesnetwork synthesis gamesstrongly polynomial procedure
Cooperative games (91A12) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Abstract computational complexity for mathematical programming problems (90C60) Production theory, theory of the firm (91B38) Games involving graphs (91A43)
Cites Work
- Title not available (Why is that?)
- Traveling salesman games
- The assignment game. I: The core
- The kernel and bargaining set for convex games
- A generalized linear production model: A unifying model
- Minimum cost spanning tree games
- On the core of linear production games
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
- The ellipsoid method and its consequences in combinatorial optimization
- Title not available (Why is that?)
- Optimum branchings
- On the core and nucleolus of minimum cost spanning tree games
- Generalized Network Problems Yielding Totally Balanced Games
- Totally Balanced Games and Games of Flow
- Title not available (Why is that?)
- On cost allocation for a spanning tree: A game theoretic approach
- Cost allocation for steiner trees
- Cost allocation for a spanning tree
- An Application of Generalized Linear Programming to Network Flows
- Synthesis of a Communication Network
- A dual ascent approach for steiner tree problems on a directed graph
- On the core of a traveling salesman cost allocation game
- Packing rooted directed cuts in a weighted directed graph
- On cost allocation in communication networks
Cited In (32)
- Cooperative networks games with elastic demands
- A core-allocation for a network restricted linear production game
- Minimum cost forest games
- A cost-sharing method for an economic lot-sizing game
- Cost sharing in networks: some open questions
- Social enterprise tree network games
- A compact linear program for testing optimality of perfect matchings.
- The complexity of egalitarian mechanisms for linear programming games
- Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
- Averaged dual solution for linear production games and its characterization
- On the core of the minimum cost Steiner tree game in networks
- Trouble comes in threes: core stability in minimum cost connection networks
- On approximately fair cost allocation in Euclidean TSP games
- Access network synthesis game in next generation networks
- On the core of a traveling salesman cost allocation game
- A non-cooperative game theory approach to cost sharing in networks
- Stochastic linear programming games with concave preferences
- LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES
- On the complexity of testing membership in the core of min-cost spanning tree games
- A note on Steiner tree games
- Extended cooperative networks games
- Minimum cost connection networks: truth-telling and implementation
- A cooperative location game based on the 1-center location problem
- On some approximately balanced combinatorial cooperative games
- Efficient computation of the Shapley value for large-scale linear production games
- Efficient Black-Box Reductions for Separable Cost Sharing
- Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner
- Pricing traffic in a spanning network
- Title not available (Why is that?)
- Tarification par des jeux Coopératifs avec Demandes Élastiques
- Strategic cooperation in cost sharing games
- Dynamic linear programming games with risk-averse players
Recommendations
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)
