A. Abdulkadiro?lu and T. Sönmez, Random serial dictatorship and the core from random endowments in house allocation problems, Econometrica, vol.66, issue.3, pp.689-701, 1998.

R. Abebe, J. Kleinberg, and D. C. Parkes, Fair division via social comparison, Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems (AAMAS-17), pp.281-289, 2017.

G. Amanatidis, G. Birmpas, and V. Markakis, Comparing approximate relaxations of envy-freeness, Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI-18), pp.42-48, 2018.
DOI : 10.24963/ijcai.2018/6
URL : http://arxiv.org/pdf/1806.03114

B. Aspvall, M. F. Plass, and R. E. Tarjan, A linear-time algorithm for testing the truth of certain quantified boolean formulas, Information Processing Letters, vol.8, issue.3, pp.121-123, 1979.

G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-spaccamela et al., Complexity and approximation: Combinatorial optimization problems and their approximability properties, 2012.

H. Aziz, S. Bouveret, I. Caragiannis, I. Giagkousi, and J. Lang, Knowledge, fairness, and social constraints, Proceedings of the 32nd Conference on Artificial Intelligence (AAAI-18), pp.4638-4645, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01802291

H. Aziz, J. L. Hougaard, J. D. Moreno-ternero, and L. P. Østerdal, Computational aspects of assigning agents to a line, Mathematical Social Sciences, vol.90, pp.93-99, 2017.

H. Aziz, I. Schlotter, and T. Walsh, Control of fair division, Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI-16), pp.67-73, 2016.

S. Bade, Matching with single-peaked preferences, Journal of Economic Theory, vol.180, pp.81-99, 2019.
DOI : 10.1016/j.jet.2018.12.004

A. L. Barabási and R. Albert, Emergence of scaling in random networks, Science, vol.286, issue.5439, pp.509-512, 1999.

X. Bei, Y. Qiao, and S. Zhang, Networked Fairness in Cake Cutting, Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI-17), pp.3632-3638, 2017.
DOI : 10.24963/ijcai.2017/508
URL : https://www.ijcai.org/proceedings/2017/0508.pdf

P. Berman, M. Karpinski, and A. D. Scott, Approximation hardness of short symmetric instances of MAX-3SAT, Electronic Colloquium on Computational Complexity (ECCC, issue.49, 2003.

V. Bilò, I. Caragiannis, M. Flammini, A. Igarashi, G. Monaco et al., Almost envy-free allocations with connected bundles, Proceedings of the 10th Conference on Innovations in Theoretical Computer Science, 2019.

D. Black, On the rationale of group decision-making, Journal of Political Economy, vol.56, issue.1, pp.23-34, 1948.

D. Black, R. A. Newing, I. Mclean, A. Mcmillan, and B. L. Monroe, The theory of committees and elections, 1958.

S. Bouveret, K. Cechlárová, E. Elkind, A. Igarashi, and D. Peters, Fair division of a graph, Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI-17), pp.135-141, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01609255

S. Bouveret, Y. Chevaleyre, and N. Maudet, Handbook of Computational Social Choice, vol.12, pp.284-310, 2016.

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

R. Bredereck, A. Kaczmarczyk, and R. Niedermeier, Envy-free allocations respecting social networks, Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS-18), pp.283-291, 2018.

R. Burkard, M. Dell'amico, and S. Martello, , 2012.

I. Caragiannis, C. Kaklamanis, P. Kanellopoulos, and M. Kyropoulou, On low-envy truthful allocations, Proceedings of the 1st International Conference on Algorithmic Decision Theory (ADT-09), pp.111-119, 2009.
DOI : 10.1007/978-3-642-04428-1_10
URL : http://www.ceid.upatras.gr/caragian/adt09.pdf

S. Cato, Local strict envy-freeness in large economies, Mathematical Social Sciences, vol.59, issue.3, pp.319-322, 2010.
DOI : 10.1016/j.mathsocsci.2010.01.002

Y. Chevaleyre, U. Endriss, and N. Maudet, Distributed fair allocation of indivisible goods, Artificial Intelligence, vol.242, pp.1-22, 2017.
DOI : 10.1016/j.artint.2016.09.005
URL : https://hal.archives-ouvertes.fr/hal-01359645

A. Damamme, A. Beynier, Y. Chevaleyre, and N. Maudet, The power of swap deals in distributed resource allocation, Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems (AAMAS-15), pp.625-633, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01212603

J. P. Dickerson, J. R. Goldman, J. Karp, A. D. Procaccia, and T. Sandholm, The computational rise and fall of fairness, Proceedings of the 28th Conference on Artificial Intelligence (AAAI-14), pp.1405-1411, 2014.

A. Feldman and A. Kirman, Fairness and envy, The American Economic Review, vol.64, issue.6, pp.995-1005, 1974.

M. Feldman, K. Lai, and L. Zhang, The proportional-share allocation market for computational resources, IEEE Transactions on Parallel and Distributed Systems, vol.20, issue.8, pp.1075-1088, 2009.
DOI : 10.1109/tpds.2008.168

M. R. Fellows, D. Hermelin, F. Rosamond, and S. Vialette, On the parameterized complexity of multiple-interval graph problems, Theoretical Computer Science, vol.410, issue.1, pp.53-61, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00619739

L. Festinger, A theory of social comparison process, Human Relations, vol.7, issue.2, pp.117-140, 1954.

M. Flammini, M. Mauro, and M. Tonelli, On social envy-freeness in multi-unit markets, Proceedings of the 32nd Conference on Artificial Intelligence (AAAI-18), pp.1031-1038, 2018.
DOI : 10.1016/j.artint.2018.12.003

D. K. Foley, Resource allocation and the public sector, Yale Economic Essays, vol.7, issue.1, pp.45-98, 1967.

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

W. V. Gehrlein and P. C. Fishburn, The probability of the paradox of voting: A computable solution, Journal of Economic Theory, vol.13, issue.1, pp.14-25, 1976.

L. Gourvès, J. Lesca, and A. Wilczynski, Object allocation via swaps along a social network, Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI-17), pp.213-219, 2017.

A. A. Hagberg, D. A. Schult, and P. J. Swart, Exploring network structure, dynamics, and function using NetworkX, Proceedings of the 7th Python in Science Conference (SciPy-08), pp.11-15, 2008.

A. Hylland and R. Zeckhauser, The efficient allocation of individuals to positions, Journal of Political Economy, vol.87, issue.2, pp.293-314, 1979.

A. Igarashi and D. Peters, Pareto-optimal allocation of indivisible goods with connectivity constraints, Proceedings of the 33rd Conference on Artificial Intelligence (AAAI-19), 2019.

B. De-keijzer, S. Bouveret, T. Klos, and Y. Zhang, On the complexity of efficiency and envy-freeness in fair division of indivisible goods with additive preferences, Proceedings of the 1st International Conference on Algorithmic Decision Theory (ADT-09), pp.98-110, 2009.

J. M. Kleinberg and É. Tardos, Algorithm Design, 2006.

A. Y. Kondratev and A. S. Nesterov, Minimal envy and popular matchings, 2019.

R. J. Lipton, E. Markakis, E. Mossel, and A. Saberi, On approximately fair allocations of indivisible goods, Proceedings of the 5th ACM Conference on Electronic Commerce (EC-04), pp.125-131, 2004.
DOI : 10.1145/988772.988792
URL : http://pages.cs.aueb.gr/~markakis/research/envy-journal5.pdf

T. T. Nguyen and J. Rothe, Minimizing envy and maximizing average Nash social welfare in the allocation of indivisible goods, Discrete Applied Mathematics, vol.179, pp.54-68, 2014.

V. T. Paschos, A (?/2)-approximation algorithm for the maximum independent set problem, Information Processing Letters, vol.44, issue.1, pp.11-13, 1992.
DOI : 10.1016/0020-0190(92)90248-t

A. Saffidine and A. Wilczynski, Constrained swap dynamics over a social network in distributed resource reallocation, Proceedings of the 11th International Symposium on Algorithmic Game Theory (SAGT-18), pp.213-225, 2018.
DOI : 10.1007/978-3-319-99660-8_19

A. Steger and N. C. Wormald, Generating random regular graphs quickly, Combinatorics, Probability and Computing, vol.8, issue.4, pp.377-396, 1999.

W. Suksompong, Fairly allocating contiguous blocks of indivisible items, Discrete Applied Mathematics, vol.260, pp.227-236, 2019.
DOI : 10.1016/j.dam.2019.01.036
URL : http://arxiv.org/pdf/1707.00345

L. G. Svensson, Strategy-proof allocation of indivisible goods, Social Choice and Welfare, vol.16, issue.4, pp.557-567, 1999.
DOI : 10.1007/s003550050160

V. V. Vazirani, Approximation Algorithms, 2001.

L. Zhou, On a conjecture by Gale about one-sided matching problems, Journal of Economic Theory, vol.52, issue.1, pp.123-135, 1990.
DOI : 10.1016/0022-0531(90)90070-z