1. Bansal, N., Sviridenko, M.: The Santa Claus problem. In: Proceedings of the 38th ACM Symposium on Theory of Computing, pp. 31–40. ACM (2006)
2. Bouveret, S.: Fair allocation of indivisible items: Modeling, computational complexity and algorithmics. Ph.D. Thesis, Institut Supérieur De L’Aéronautique Et De l’Espace, Toulouse, France (2007)
3. Bouveret, S., Chevaleyre, Y., Maudet, N.: Handbook of computational social choice, chap. 12. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A. (eds.) , pp 284–310. Cambridge University Press, Cambridge (2016)
4. Bouveret, S., Lemaître, M., Fargier, H., Lang, J.: Allocation of indivisible goods: A general model and some complexity results (extended abstract). In: Proceedings of the 4th international joint conference on autonomous agents and multiagent systems, pp. 1309–1310. ACM Press (2005)
5. Brams, S., Taylor, A.: Fair division: From cake-cutting to dispute resolution. Cambridge University Press, Cambridge (1996)