The minimum cost shortest-path tree game
From MaRDI portal
Recommendations
Cites work
- A non-cooperative approach to the cost spanning tree problem.
- An extension to rapid transit network design problem
- Balanced per capita contributions and level structure of cooperation
- Cost allocation in shortest path games
- scientific article; zbMATH DE number 3989126 (Why is no real title available?)
- scientific article; zbMATH DE number 1090983 (Why is no real title available?)
- Minimum cost spanning tree games
- Multi-criteria minimum cost spanning tree games
- On cost allocation for a spanning tree: A game theoretic approach
- On shortest path games
- Operations research games: A survey. (With comments and rejoinder)
- Opportune moment strategies for a cost spanning tree game
- Optimal equilibria in the non-cooperative game associated with cost spanning tree problem
- Partially Ordered Sets
- Routing to Multiple Destinations in Computer Networks
- Shortest shortest path trees of a network
- Spanning Trees and Optimization Problems
Cited in
(9)- Minimum cost forest games
- Cost allocation in shortest path games
- An algorithm to compute the nucleolus of shortest path games
- Extreme value distributions for two kinds of path sums of Markov chain
- The shortest connection game
- A SEARCH GAME WITH TRAVELING COST ON A TREE
- The Stackelberg minimum spanning tree game
- On the shortest path game
- The minimum cost spanning forest game
This page was built for publication: The minimum cost shortest-path tree game
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1761744)
