Cost allocation for steiner trees
From MaRDI portal
Publication:4159214
Cites work
Cited in
(26)- On the core of a traveling salesman cost allocation game
- Supportability of network cost functions
- Cost allocation in the Chinese postman problem
- Minimum cost forest games
- Minimum cost spanning tree games and population monotonic allocation schemes.
- Total balancedness condition for Steiner tree games.
- Traveling salesman games with the Monge property
- Steiner minimal trees on regular polygons with centre
- Strategic cooperation in cost sharing games
- Pricing traffic in a spanning network
- Trouble comes in threes: core stability in minimum cost connection networks
- A survey on networking games in telecommunications
- A core-allocation for a network restricted linear production game
- Cost sharing in networks: some open questions
- Minimal subsidies in expense sharing games
- On the core and nucleolus of minimum cost spanning tree games
- Cooperative networks games with elastic demands
- Minimum cost spanning tree games
- Efficient black-box reductions for separable cost sharing
- Efficient black-box reductions for separable cost sharing
- Averaged dual solution for linear production games and its characterization
- Connection problems in mountains and monotonic allocation schemes.
- Axiomatization of the Shapley value on minimum cost spanning tree games
- Implementation of welfare maximizing networks
- On the core of network synthesis games
- Sharing the cost of multicast transmissions in wireless networks
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)
