Pages that link to "Item:Q1897387"
From MaRDI portal
The following pages link to On the core of the minimum cost Steiner tree game in networks (Q1897387):
Displaying 15 items.
- Cooperative location games based on the minimum diameter spanning Steiner subgraph problem (Q423895) (← links)
- On the core of network synthesis games (Q757264) (← links)
- On a cost allocation problem arising from a capacitated concentrator covering problem (Q1316101) (← links)
- Sharing the cost of a network: core and core allocations (Q1414428) (← links)
- Social enterprise tree network games (Q1622035) (← links)
- The minimum cost shortest-path tree game (Q1761744) (← links)
- Total balancedness condition for Steiner tree games. (Q1811075) (← links)
- Cost allocation in spanning network enterprises with stochastic connection costs. (Q1811556) (← links)
- Strategic cooperation in cost sharing games (Q1939521) (← links)
- Trouble comes in threes: core stability in minimum cost connection networks (Q2242222) (← links)
- On the set of extreme core allocations for minimal cost spanning tree problems (Q2397642) (← links)
- A note on Steiner tree games (Q2892158) (← links)
- Minimal Subsidies in Expense Sharing Games (Q3162532) (← links)
- SUFFICIENT CONDITIONS FOR NONEMPTY CORE OF MINIMUM COST FOREST GAMES (Q4407200) (← links)
- Stable source connection and assignment problems as multi-period shortest path problems (Q6665449) (← links)
