Cost allocation for steiner trees
From MaRDI portal
Publication:4159214
DOI10.1002/NET.3230080104zbMATH Open0378.90118OpenAlexW2090279452MaRDI QIDQ4159214FDOQ4159214
Authors: Nimrod Megiddo
Publication date: 1978
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230080104
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Other game-theoretic models (91A40) Operations research and management science (90B99)
Cites Work
Cited In (25)
- Cooperative networks games with elastic demands
- Connection problems in mountains and monotonic allocation schemes.
- A core-allocation for a network restricted linear production game
- Minimum cost forest games
- Sharing the cost of multicast transmissions in wireless networks
- Efficient black-box reductions for separable cost sharing
- Efficient black-box reductions for separable cost sharing
- Cost sharing in networks: some open questions
- Averaged dual solution for linear production games and its characterization
- On the core of network synthesis games
- Cost allocation in the Chinese postman problem
- Trouble comes in threes: core stability in minimum cost connection networks
- Supportability of network cost functions
- Steiner minimal trees on regular polygons with centre
- Traveling salesman games with the Monge property
- A survey on networking games in telecommunications
- On the core of a traveling salesman cost allocation game
- Axiomatization of the Shapley value on minimum cost spanning tree games
- Total balancedness condition for Steiner tree games.
- Minimum cost spanning tree games and population monotonic allocation schemes.
- Minimum cost spanning tree games
- On the core and nucleolus of minimum cost spanning tree games
- Pricing traffic in a spanning network
- Strategic cooperation in cost sharing games
- Minimal subsidies in expense sharing games
This page was built for publication: Cost allocation for steiner trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4159214)