On the core of network synthesis games

DOI10.1007/BF01594930zbMath0722.90091OpenAlexW2060444450MaRDI QIDQ757264

Arie Tamir

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

zbMATH Keywords

corelinear production gameminimum cost spanning tree gamenetwork design cooperative gamesnetwork synthesis gamesstrongly polynomial procedure

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Cooperative games (91A12) Games involving graphs (91A43) Production theory, theory of the firm (91B38) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (31)

A core-allocation for a network restricted linear production game ⋮ Social enterprise tree network games ⋮ A note on Steiner tree games ⋮ Tarification par des jeux Coopératifs avec Demandes Élastiques ⋮ Stochastic linear programming games with concave preferences ⋮ On the core of the minimum cost Steiner tree game in networks ⋮ On the complexity of testing membership in the core of min-cost spanning tree games ⋮ Minimum cost forest games ⋮ The complexity of egalitarian mechanisms for linear programming games ⋮ 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 ⋮ Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner ⋮ Minimum cost connection networks: truth-telling and implementation ⋮ Strategic cooperation in cost sharing games ⋮ Averaged dual solution for linear production games and its characterization ⋮ Unnamed Item ⋮ Cooperative location games based on the minimum diameter spanning Steiner subgraph problem ⋮ Cooperative networks games with elastic demands ⋮ A compact linear program for testing optimality of perfect matchings. ⋮ Trouble comes in threes: core stability in minimum cost connection networks ⋮ LINEAR AND INTEGER PROGRAMMING TECHNIQUES FOR COOPERATIVE GAMES ⋮ Dynamic linear programming games with risk-averse players ⋮ Pricing traffic in a spanning network ⋮ A cooperative location game based on the 1-center location problem ⋮ A cost-sharing method for an economic lot-sizing game ⋮ Extended cooperative networks games ⋮ A non-cooperative game theory approach to cost sharing in networks ⋮ Efficient Black-Box Reductions for Separable Cost Sharing ⋮ COST SHARING IN NETWORKS: SOME OPEN QUESTIONS ⋮ On some approximately balanced combinatorial cooperative games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the core of a traveling salesman cost allocation game
• The ellipsoid method and its consequences in combinatorial optimization
• Traveling salesman games
• The assignment game. I: The core
• The kernel and bargaining set for convex games
• On cost allocation in communication networks
• An Application of Generalized Linear Programming to Network Flows
• A dual ascent approach for steiner tree problems on a directed graph
• On the core and nucleolus of minimum cost spanning tree games
• A generalized linear production model: A unifying model
• Minimum cost spanning tree games
• Generalized Network Problems Yielding Totally Balanced Games
• Totally Balanced Games and Games of Flow
• On the core of linear production games
• Cost allocation for a spanning tree
• On cost allocation for a spanning tree: A game theoretic approach
• Cost allocation for steiner trees
• Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
• Packing rooted directed cuts in a weighted directed graph
• Optimum branchings
• Synthesis of a Communication Network

This page was built for publication: On the core of network synthesis games