The following pages link to Shortest path games (Q2253411):
Displaying 22 items.
- The Shapley value for shortest path games: a non-graph-based approach (Q301134) (← links)
- Stochastic linear programming games with concave preferences (Q319166) (← links)
- A solution concept for network games: the role of multilateral interactions (Q319240) (← links)
- On the core and bargaining set of a veto game (Q328547) (← links)
- On the nucleolus of shortest path games (Q681844) (← links)
- Path cooperative games (Q724748) (← links)
- Cost allocation in shortest path games (Q1396937) (← links)
- On shortest path games (Q1397689) (← links)
- Consistency requirements and pattern methods in cost sharing problems with technological cooperation (Q1621724) (← links)
- The minimum cost shortest-path tree game (Q1761744) (← links)
- Hyperadditive games and applications to networks or matching problems (Q1995312) (← links)
- An algorithm to compute the nucleolus of shortest path games (Q1999962) (← links)
- Answers set programs for non-transferable utility games: expressiveness, complexity and applications (Q2060739) (← links)
- Strong time-consistent core for a class of linear-state games (Q2219862) (← links)
- Stable cost sharing in production allocation games (Q2318129) (← links)
- A cost sharing example in which subsidies are necessary for stability (Q2334315) (← links)
- Stable lexicographic rules for shortest path games (Q2345157) (← links)
- Minimum cost spanning tree problems with indifferent agents (Q2442831) (← links)
- Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner (Q2670475) (← links)
- “Beat-Your-Rival” Routing Games (Q5896078) (← links)
- Stable and weakly additive cost sharing in shortest path problems (Q6146452) (← links)
- Stable source connection and assignment problems as multi-period shortest path problems (Q6665449) (← links)
