References

[1] M. Baïou and F. Barahona: An Algorithm to Compute the Nucleolus of Shortest Path Games. Algorithmica 81(8) 3099-3113 (2019).
[2] J. Konemann, K. Pashkovich and J. toth: Computing the Nucleolus of weighted cooperative matching games in polynomial time. IPCO 2019, LNCS 11480, pp. 413-426, 2019.
[3] Deng, X., Fang, Q., Sun, X.: Finding nucleolus of ow game. Journal of combinatorial optimization 18(1), 64-86 (2009).
[4] Elkind, E., Goldberg, L.A., Goldberg, P., Wooldridge, M.: Computational complexity of weighted threshold games. In: Proceedings of the National Conference on Articial Intelligence, p. 718 (2007).
[5] Faigle, U., Kern, W., Kuipers, J.: Note computing the nucleolus of min-cost spanning tree games is np-hard. International Journal of Game Theory 27(3), 443-450 (1998).
[6] Faigle, U., Kern, W., Paulusma, D.: Note on the computational complexity of least core concepts for min-cost spanning tree games. Mathematical methods of operations research 52(1), 23-38 (2000).

Informations and Contacts