Pages that link to "Item:Q3157039"
From MaRDI portal
The following pages link to A network flow approach to cost allocation for rooted trees (Q3157039):
Displaying 14 items.
- Cost allocation in asymmetric trees (Q296616) (← links)
- On the core and nucleolus of directed acyclic graph games (Q526836) (← links)
- The nucleolus of trees with revenues (Q857952) (← links)
- Fair cost allocations under conflicts - a game-theoretic point of view - (Q924627) (← links)
- Sharing the cost of a network: core and core allocations (Q1414428) (← links)
- Computation of the Shapley value of minimum cost spanning tree games: P-hardness and polynomial cases (Q1926641) (← links)
- Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions (Q2032152) (← links)
- Cost-allocation problems for fuzzy agents in a fixed-tree network (Q2096663) (← links)
- One-way and two-way cost allocation in hub network problems (Q2178916) (← links)
- A polynomial expression for the Owen value in the maintenance cost game (Q2810094) (← links)
- REDUCTION OF ULTRAMETRIC MINIMUM COST SPANNING TREE GAMES TO COST ALLOCATION GAMES ON ROOTED TREES (Q3575947) (← links)
- Game Theory and Cost Allocation Problems (Q3727767) (← links)
- A family of cost allocation methods for a tree (Q3991721) (← links)
- Multi-period maintenance scheduling of tree networks with minimum flow disruption (Q5198690) (← links)
