Pages that link to "Item:Q2397642"
From MaRDI portal
The following pages link to On the set of extreme core allocations for minimal cost spanning tree problems (Q2397642):
Displaying 14 items.
- Comments on: ``Remarkable polyhedra related to set functions, games and capacities'' (Q301381) (← links)
- A new stable and more responsive cost sharing solution for minimum cost spanning tree problems (Q417711) (← links)
- On a class of vertices of the core (Q1651303) (← links)
- Multi-criteria minimum cost spanning tree games (Q1876137) (← links)
- Sharing the cost of maximum quality optimal spanning trees (Q1979176) (← links)
- Hyperadditive games and applications to networks or matching problems (Q1995312) (← links)
- A non-cooperative game theory approach to cost sharing in networks (Q2067258) (← links)
- Clique games: a family of games with coincidence between the nucleolus and the Shapley value (Q2173166) (← links)
- One-way and two-way cost allocation in hub network problems (Q2178916) (← links)
- A cost sharing example in which subsidies are necessary for stability (Q2334315) (← links)
- Minimum cost spanning tree problems with indifferent agents (Q2442831) (← links)
- Minimum cost spanning tree problems as value sharing problems (Q2689423) (← links)
- (Q3142820) (← links)
- Demand operators and the Dutta-Kar rule for minimum cost spanning tree problems (Q6590144) (← links)
