Y. Chevaleyre, U. Endriss, S. Estivie, and N. Maudet, Reaching envy-free states in distributed negotiation settings, Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-2007), pp.1239-1244, 2007.

Y. Chevaleyre, U. Endriss, and N. Maudet, Allocating goods on a graph to eliminate envy, Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI-2007, pp.700-705, 2007.

S. J. Brams and A. D. Taylor, Fair Division: From Cake-cutting to Dispute Resolution, 1996.
DOI : 10.1017/CBO9780511598975

J. Robertson and W. Webb, Cake-Cutting Algorithms: Be fair if you can, A.K. Peters, 1998.

A. D. Procaccia, Cake Cutting Algorithms, Handbook of Computational Social Choice, pp.311-329, 2016.
DOI : 10.1017/CBO9781107446984.014

A. Alkan, G. Demange, and D. Gale, Fair Allocation of Indivisible Goods and Criteria of Justice, Econometrica, vol.59, issue.4, pp.1023-1039, 1991.
DOI : 10.2307/2938172
URL : https://hal.archives-ouvertes.fr/halshs-00670945

C. Beviá, Fair allocation in a general model with indivisible goods, Review of Economic Design, vol.3, issue.3, pp.195-213, 1998.
DOI : 10.1007/s100580050013

K. Tadenuma, Trade-off between equity and efficiency in a general economy with indivisible goods, Social Choice and Welfare, vol.13, issue.4, pp.445-450, 1996.
DOI : 10.1007/BF00182854

S. Bouveret, Y. Chevaleyre, and N. Maudet, Fair Allocation of Indivisible Goods, Handbook of Computational Social Choice, pp.284-310, 2016.
DOI : 10.1017/CBO9781107446984.013

W. Thomson, Fair Allocation Rules, Handbook of Social Choice and Welfare, pp.393-506, 2011.
DOI : 10.1016/S0169-7218(10)00021-3

Y. Chevaleyre, P. E. Dunne, U. Endriss, J. Lang, M. Lema??trelema??tre et al., Issues in multiagent resource allocation, Informatica, vol.30, pp.3-31, 2006.

R. 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

U. Endriss, N. Maudet, F. Sadri, and F. Toni, Negotiating socially optimal allocations of resources, Journal of Artificial Intelligence Research, vol.25, pp.315-348, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01393006

S. Bouveret and J. Lang, Efficiency and envy-freeness in fair division of indivisible goods: Logical representation and complexity, Journal of Artificial Intelligence Research, vol.32, pp.525-564, 2008.

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-2009), pp.111-119, 2009.
DOI : 10.1007/978-3-642-04428-1_10

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-2009), pp.98-110, 2009.
DOI : 10.1007/978-3-642-04428-1_9

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.
DOI : 10.1007/s003550100119

T. W. Sandholm, Contract types for satisficing task allocation: I Theoretical results, Proceedings of the 1998 AAAI Spring Symposium on Satisficing Models, 1998.

P. E. Dunne, M. Wooldridge, and M. Laurence, The complexity of contract negotiation, Artificial Intelligence, vol.164, issue.1-2, pp.1-2, 2005.
DOI : 10.1016/j.artint.2005.01.006

Y. Chevaleyre, U. Endriss, and N. Maudet, Simple negotiation schemes for agents with simple preferences: sufficiency, necessity and maximality, Autonomous Agents and Multi-Agent Systems, vol.29, issue.12, pp.234-259, 2010.
DOI : 10.1007/s10458-009-9088-7

S. Airiau and U. Endriss, Multiagent resource allocation with sharable items, Autonomous Agents and Multi-Agent Systems, vol.1, issue.1, pp.956-985, 2014.
DOI : 10.1007/s10458-013-9245-x
URL : https://hal.archives-ouvertes.fr/hal-01493518

A. Netzer, A. Meisels, and R. Zivan, Distributed envy minimization for resource allocation, Autonomous Agents and Multi-Agent Systems, vol.46, issue.1???2, pp.364-402, 2016.
DOI : 10.1007/s10458-015-9291-7

H. Moulin, Axioms of Cooperative Decision Making, 1988.
DOI : 10.1017/CCOL0521360552

S. Estivie, Y. Chevaleyre, U. Endriss, and N. Maudet, How equitable is rational negotiation?, Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems , AAMAS '06, pp.866-873, 2006.
DOI : 10.1145/1160633.1160788

H. Steinhaus, The problem of fair division, Econometrica, vol.16, issue.1, pp.101-104, 1948.

M. G. Raith, Fair-negotiation procedures, Mathematical Social Sciences, vol.39, issue.3, pp.303-322, 2000.
DOI : 10.1016/S0165-4896(99)00032-3

U. Endriss and N. Maudet, On the Communication Complexity of Multilateral Trading: Extended Report, Autonomous Agents and Multi-Agent Systems, vol.42, issue.1-3, pp.91-107, 2005.
DOI : 10.1007/s10458-005-1080-2

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

D. Gale, The Theory of Linear Economic Models, 1960.

M. H. Rothkopf, A. Peke?-c, and R. M. Harstad, Computationally Manageable Combinational Auctions, Computationally manageable combinational auctions, pp.1131-1147, 1998.
DOI : 10.1287/mnsc.44.8.1131

F. Klijn, An algorithm for envy-free allocations in an economy with indivisible objects and money, Social Choice and Welfare, vol.17, issue.2, pp.201-215, 2000.
DOI : 10.1007/s003550050015

C. Haake, M. G. Raith, and F. E. Su, Bidding for envy-freeness: A procedural approach to n-player fair-division problems, Social Choice and Welfare, vol.19, issue.4, pp.723-749, 2002.
DOI : 10.1007/s003550100149

H. W. Kuhn, The Hungarian method for the assignment problem, Naval Research Logistics Quarterly, vol.3, issue.1-2, pp.83-97, 1955.
DOI : 10.1002/nav.3800020109

M. De-weerdt, Y. Zhang, and T. Klos, Multiagent task allocation in social networks, Autonomous Agents and Multi-Agent Systems, vol.393, issue.2, pp.46-86, 2012.
DOI : 10.1007/s10458-011-9168-3

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

S. J. Brams, M. A. Jones, and C. Klamler, Divide-and-Conquer: A Proportional, Minimal-Envy Cake-Cutting Algorithm, SIAM Review, vol.53, issue.2, pp.291-307, 2011.
DOI : 10.1137/080729475

C. Lindner and J. Rothe, Degrees of Guaranteed Envy-Freeness in Finite Bounded Cake-Cutting Protocols, Proceedings of the 5th International Workshop on Internet and Network Economics (WINE-2009), pp.149-159, 2009.
DOI : 10.1007/978-3-642-10841-9_15

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.
DOI : 10.1016/j.dam.2014.09.010

H. Hosseini, K. Larson, and R. Cohen, Matching with dynamic ordinal preferences, Proceedings of the 29th AAAI Conference on Artificial Intelligence, pp.936-943, 2015.

D. Lehmann, L. I. O-'callaghan, and Y. Shoham, Truth revelation in approximately efficient combinatorial auctions, Journal of the ACM, vol.49, issue.5, pp.577-602, 2002.
DOI : 10.1145/585265.585266

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