An Algorithm to Compute the Nucleolus of Shortest Path Games
- 13 Downloads
We study a type of cooperative games introduced in Fragnelli et al. (Math Methods Oper Res 52(2):251–264, 2000) 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.
KeywordsCooperative games Shortest path games Nucleolus
We are grateful to an anonymous referee for his careful reading. His comments helped us to improve the presentation. This work has been partially supported by the French government research program “Investissements d’Avenir” through the IDEX-ISITE initiative 16-IDEX-0001 (CAP 20-25) and the IMobS3 Laboratory of Excellence (ANR-10-LABX-16-01).
- 2.Aziz, H., Sørensen, T.B.: Path coalitional games (2011). arXiv preprint arXiv:1103.3310
- 6.Elkind, E., Pasechnik, D.: Computing the nucleolus of weighted voting games. In: Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 327–335. Society for Industrial and Applied Mathematics (2009)Google Scholar
- 8.Fang, Q., Li, B., Shan, X., Sun, X.: The least-core and nucleolus of path cooperative games. In: International Computing and Combinatorics Conference, pp. 70–82. Springer (2015)Google Scholar
- 17.Kopelowitz, A.: Computation of the kernels of simple games and the nucleolus of n-person games. Technical Report, DTIC Document (1967)Google Scholar