1. Carreras F. and Freixas J., Complete simple games.Math. Soc. Sci.32(1996) 139–155.
2. Deĭneko V.G. and Woeginger G.J., On the dimension of simple monotonic games.Eur. J. Oper. Res.170(2006) 315–318.
3. Deng X. and Papadimitriou C.H., On the complexity of cooperative solution concepts.Math. Oper. Res.19(1994) 257–266.
4. E. Elkind and D. Pasechnik, Computing the nucleolus of weighted voting games, inSODA ’09 : Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics. Philadelphia, PA, USA (2009) 327–335.
5. E. Elkind, L.A. Goldberg, P.W. Goldberg and M. Wooldridge, Computational complexity of weighted threshold games, inProceedings of the Twenty-Second AAAI Conference on Artificial Intelligence. Vancouver, British Columbia, Canada (2007) 718–723.