Pages that link to "Item:Q1396937"
From MaRDI portal
The following pages link to Cost allocation in shortest path games (Q1396937):
Displaying 17 items.
- The Shapley value for shortest path games: a non-graph-based approach (Q301134) (← links)
- Proof systems and transformation games (Q354613) (← links)
- On the nucleolus of shortest path games (Q681844) (← links)
- Path cooperative games (Q724748) (← links)
- Forms of representation for simple games: sizes, conversions and equivalences (Q898760) (← links)
- Modeling cooperation on a class of distribution problems (Q1042048) (← links)
- On the core of a traveling salesman cost allocation game (Q1122517) (← links)
- Cooperative games arising from network flow problems (Q1178645) (← links)
- Operations research games: A survey. (With comments and rejoinder) (Q1348703) (← links)
- On approximately fair cost allocation in Euclidean TSP games (Q1384221) (← links)
- On shortest path games (Q1397689) (← links)
- The proportional Shapley value and applications (Q1651258) (← links)
- Computing the strong Nash equilibrium for Markov chains games (Q1664280) (← links)
- The minimum cost shortest-path tree game (Q1761744) (← links)
- Shortest path games (Q2253411) (← links)
- Stable lexicographic rules for shortest path games (Q2345157) (← links)
- Stable and weakly additive cost sharing in shortest path problems (Q6146452) (← links)