On the Nucleolus of Shortest Path Games
We study a type of cooperative games introduced in  called shortest path games. They arise on a network that has two special nodes s and t. A coalition corresponds to a set of arcs and it receives a reward if it can connect s and t. A coalition also incurs a cost for each arc that it uses to connect s and t, thus the coalition must choose a path of minimum cost among all the arcs that it controls. These games are relevant to logistics, communication, or supply-chain networks. We give a polynomial combinatorial algorithm to compute the nucleolus. This vector reflects the relative importance of each arc to ensure the connectivity between s and t. Our development is done on a directed graph, but it can be extended to undirected graphs and to similar games defined on the nodes of a graph.
KeywordsCooperative games Shortest path games Nucleolus
- 2.Aziz, H., Sørensen, T.B.: Path coalitional games, arXiv preprint arXiv:1103.3310 (2011)
- 5.Elkind, E., Pasechnik, D.: Computing the nucleolus of weighted voting games. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, pp. 327–335 (2009)Google Scholar
- 14.Kopelowitz, A.: Computation of the kernels of simple games and the nucleolus of n-person games. Technical report, DTIC Document (1967)Google Scholar