Pages that link to "Item:Q681844"
From MaRDI portal
The following pages link to On the nucleolus of shortest path games (Q681844):
Displaying 13 items.
- The Shapley value for shortest path games: a non-graph-based approach (Q301134) (← links)
- On the core and nucleolus of directed acyclic graph games (Q526836) (← links)
- Path cooperative games (Q724748) (← links)
- Cost allocation in shortest path games (Q1396937) (← links)
- On shortest path games (Q1397689) (← links)
- An algorithm to compute the nucleolus of shortest path games (Q1999962) (← links)
- Network disconnection games: a game theoretic approach to checkpoint evaluation in networks (Q2064296) (← links)
- Computing the nucleolus of weighted voting games in pseudo-polynomial time (Q2089798) (← links)
- The nucleolus and inheritance of properties in communication situations (Q2095955) (← links)
- Shortest path games (Q2253411) (← links)
- Network strength games: the core and the nucleolus (Q2297643) (← links)
- A heuristic procedure for computing the nucleolus (Q2329720) (← links)
- Stable lexicographic rules for shortest path games (Q2345157) (← links)