1. Biro P, Kern W, Paulusma D (2012) Computing solutions for matching games. Int J Game Theory 41:75–90
2. Deng X (1998) Combinatorial optimization and coalition games. In: Du D, Pardalos PM (eds) Handbook of combinatorial optimization, vol 2. Kluwer, Boston, pp 77–103
3. Deng X, Fang Q, Sun X (2006) Finding nucleolus of flow games. In: Proceedings of the 17th annual ACM-SIAM symposium on discrete algorithm (SODA 2006), Miami. Lecture Notes in Computer Science, vol 3111, pp 124–131
4. Elkind P, Goldberg LA, Goldberg PW, Wooldridge M (2009) On the computational complexity of weighted voting games. Ann Math Artif Intell 56:109–131
5. Faigle U, Kern W, Kuipers J (1998) Computing the nucleolus of min-cost spanning tree games is
𝒩
𝒫
$$\mathcal{N}\mathcal{P}$$
-hard. Int J Game Theory 27:443–450