1. Abraham, D., Irving, R., Kavitha, T., Mehlhorn, K., 2005. Popular matchings. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’05, pp. 424–432.
2. Aziz, H., Brandt, F., Seedig, H., 2011. Stable partitions in additively separable hedonic games. In: Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems, AAMAS’11, pp. 183–190.
3. NP-completeness in Hedonic Games;Ballester;Games Econom. Behav.,2004
4. Core in a simple coalition formation game;Banerjee;Soc. Choice Welf.,2001
5. Baumeister, D., Bouveret, S., Lang, J., Nguyen, N., Nguyen, T., Rothe, J., Saffidine, A., 2014. Axiomatic and computational aspects of scoring allocation rules for indivisible goods. In: Proceedings of the 5th International Workshop on Computational Social Choice, COMSOC’14, pp. 1–22.