H. Aziz, S. Gaspers, S. Mackenzie, and T. Walsh, Fair assignment of indivisible objects under ordinal preferences, Artificial Intelligence, vol.227, pp.71-92, 2015.

H. Aziz, T. Walsh, and L. Xia, Possible and necessary allocations via sequential mechanisms, Proceedings of the 24th International Joint Conference on Artificial Intelligence, pp.468-474, 2015.

N. Bansal and M. Sviridenko, The Santa Claus problem, Proceedings of the 38th ACM Symposium on Theory of Computing, pp.31-40, 2006.

D. Baumeister and J. Rothe, Preference aggregation by voting. In: Rothe J (ed) Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division, vol.4, pp.197-325, 2015.

D. Baumeister, S. Bouveret, J. Lang, N. Nguyen, T. Nguyen et al., Axiomatic and computational aspects of scoring allocation rules for indivisible goods, Proceedings of the 5th International Workshop on Computational Social Choice, 2014.

D. Baumeister, S. Bouveret, J. Lang, T. Nguyen, N. Nguyen et al., Scoring rules for the allocation of indivisible goods, Proceedings of the 21st European Conference on Artificial Intelligence, pp.75-80, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01497489

S. Bouveret and J. Lang, A general elicitation-free protocol for allocating indivisible goods, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pp.73-78, 2011.

S. Bouveret and M. Lemaître, Characterizing conflicts in fair division of indivisible goods using a scale of criteria, Journal of Autonomous Agents and Multi-Agent Systems, vol.30, issue.2, pp.259-290, 2016.
URL : https://hal.archives-ouvertes.fr/hal-00961441

S. Bouveret, U. Endriss, and J. Lang, Fair division under ordinal preferences: Computing envy-free allocations of indivisible goods, Proceedings of the 19th European Conference on Artificial Intelligence, pp.387-392, 2010.

S. Bouveret, Y. Chevaleyre, and N. Maudet, Fair allocation of indivisible goods, Handbook of Computational Social Choice, p.12, 2016.

S. Brams and P. Fishburn, Voting procedures, Handbook of Social Choice and Welfare, vol.1, pp.173-236, 2002.

S. Brams and D. King, Efficient fair division-help the worst off or avoid envy?, Rationality and Society, vol.17, issue.4, pp.387-421, 2005.

S. Brams, A. Taylor, S. Brams, P. Edelman, and P. Fishburn, Fair Division: From Cake-Cutting to Dispute Resolution, Theory and Decision, vol.5, issue.2, pp.147-180, 1996.

E. Budish, The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes, Journal of Political Economy, vol.119, issue.6, pp.1061-1103, 2011.

E. Budish and E. Cantillon, The multi-unit assignment problem: Theory and evidence from course allocation at Harvard, The American Economic Review, vol.102, issue.5, pp.2237-2271, 2012.

I. Caragiannis and A. Procaccia, Voting almost maximizes social welfare despite limited communication, Artificial Intelligence, vol.175, issue.9, pp.1655-1671, 2011.

I. Caragiannis, D. Kurokawa, H. Moulin, A. Procaccia, N. Shah et al., The unreasonable fairness of maximum Nash welfare, Proceedings of the 17th ACM Conference on Economics and Computation, 2016.

A. Darmann and J. Schauer, Maximizing Nash product social welfare in allocating indivisible goods, European Journal of Operational Research, vol.247, pp.548-559, 2015.

E. Elkind, P. Faliszewski, P. Skowron, and A. Slinko, Properties of multiwinner voting rules, Proceedings of the 13th International Conference on Autonomous Agents and Multiagent Systems, pp.53-60, 2014.

P. Faliszewski and L. Hemaspaandra, The complexity of power-index comparison, Theoretical Computer Science, vol.410, issue.1, pp.101-107, 2009.

P. Gardenfors, Assignment problem based on ordinal preferences, Management Science, vol.20, issue.3, pp.331-340, 1973.

M. Garey and D. Johnson, Strong" NP-completeness results: Motivation, examples, and implications, J ACM, vol.25, issue.3, pp.499-508, 1978.

M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

N. Garg, T. Kavitha, A. Kumar, K. Mehlhorn, and J. Mestre, Assigning papers to referees, Algorithmica, vol.58, issue.1, pp.119-136, 2010.

D. Golovin, Max-min fair allocation of indivisible goods, Journal of Computer and System Sciences, vol.73, issue.1, pp.73-83, 2005.

D. Herreiner and C. Puppe, A simple procedure for finding equitable allocations of indivisible goods, Social Choice and Welfare, vol.19, issue.2, pp.415-430, 2002.

D. Kohler and R. Chandrasekaran, A class of sequential games, Operations Research, vol.19, issue.2, pp.270-277, 1971.

J. Lang and J. Rothe, Fair division of indivisible goods. In: Rothe J (ed) Economics and Computation. An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division, pp.493-550, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01493551

D. Manlove, Strategy-proofness of scoring allocation correspondences for indivisible goods, Proceedings of the 24th International Joint Conference on Artificial Intelligence, AAAI Press/IJCAI, vol.2, pp.1127-1133, 1995.

K. Pruhs and G. Woeginger, Divorcing made easy, Proceedings of the 6th International Conference on Fun with Algorithms, pp.305-314, 2012.

A. Roth and M. Sotomayor, Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis, 1990.

P. Skowron, P. Faliszewski, and A. Slinko, Fully proportional representation as resource allocation: Approximability results, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, pp.353-359, 2013.

W. Thomson, Consistency and its converse: An introduction, Review of Economic Design, vol.15, issue.4, pp.257-291, 2011.

L. Wilson, Assignment using choice lists, Operational Research Quarterly, pp.569-578, 1977.

W. Zwicker, Introduction to the theory of voting, Handbook of Computational Social Choice, 2016.