Shortest path games
From MaRDI portal
Recommendations
Cited in
(24)- Hyperadditive games and applications to networks or matching problems
- Stable cost sharing in production allocation games
- Strong time-consistent core for a class of linear-state games
- Stable and weakly additive cost sharing in shortest path problems
- An algorithm to compute the nucleolus of shortest path games
- A cost sharing example in which subsidies are necessary for stability
- Consistency requirements and pattern methods in cost sharing problems with technological cooperation
- Path cooperative games
- The Shapley value for shortest path games: a non-graph-based approach
- Stable lexicographic rules for shortest path games
- A solution concept for network games: the role of multilateral interactions
- Stochastic linear programming games with concave preferences
- “Beat-Your-Rival” Routing Games
- On the core and bargaining set of a veto game
- On shortest path games
- The shortest path game: complexity and algorithms
- Answers set programs for non-transferable utility games: expressiveness, complexity and applications
- Computing payoff allocations in the approximate core of linear programming games in a privacy-preserving manner
- Merge-proofness and cost solidarity in shortest path games
- The minimum cost shortest-path tree game
- Stable source connection and assignment problems as multi-period shortest path problems
- Cost allocation in shortest path games
- Minimum cost spanning tree problems with indifferent agents
- On the nucleolus of shortest path games
This page was built for publication: Shortest path games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2253411)
