S. Abdulkadiro?gluabdulkadiro?glu, Atila Abdulkadiro?gludiro?glu and Tayfun Sönmez Random serial dictatorship and the core from random endowments in house allocation problems Atila Abdulkadiro?gludiro?glu and Tayfun Sönmez. House allocation with existing tenants, Abdulkadiro?gluAbdulkadiro?glu and Sönmez, pp.689-701233, 1998.

. Abraham, Pareto optimality in house allocation problems, Proceedings of the 16th International Symposium on Algorithms and Computation (ISAAC), pp.1163-1175, 2005.
DOI : 10.1007/978-3-540-30551-4_3
URL : http://eprints.gla.ac.uk/1062/01/ISAAC04.pdf

. Anshelevich, Friendship and Stable Matching, Proceedings of the 21st European Symposium on Algorithms (ESA), pp.49-60, 2013.
DOI : 10.1007/978-3-642-40450-4_5

V. Arcaute, S. Arcaute, and . Vassilvitskii, Social Networks and Stable Matchings in the Job Market, Proceedings of the 5th International Workshop on Internet and Network Economics (WINE), pp.220-231, 2009.
DOI : 10.1007/978-3-642-10841-9_21

D. Aziz, B. D. Aziz, and . Keijzer, Housing markets with indifferences: A tale of two mechanisms, Proceedings of the 26th Conference on Artificial Intelligence (AAAI), pp.1249-1255, 2012.

. Aziz, Optimal reallocation under additive and ordinal preferences, Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp.402-410, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01388799

. Bodine-baron, Peer Effects and Stability in Matching Markets, Proceedings of the 4th International Symposium on Algorithmic Game Theory (SAGT), pp.117-129, 2011.
DOI : 10.1017/CBO9780511815478
URL : http://www.cs.caltech.edu/%7Eadamw/papers/matchingEC.pdf

. Chevaleyre, Negotiating over small bundles of resources, Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems , AAMAS '05, pp.296-302, 2005.
DOI : 10.1145/1082473.1082518

. Chevaleyre, Issues in multiagent resource allocation, Informatica, vol.30, issue.1, pp.3-31, 2006.

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

. Chevaleyre, Multiagent resource allocation in k-additive domains: preference representation and complexity, Damamme et al., 2015] Anastasia Damamme Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems (AA- MAS), pp.49-62, 2008.
DOI : 10.1017/CCOL0521360552
URL : https://link.springer.com/content/pdf/10.1007%2Fs10479-008-0335-0.pdf

C. Dunne, E. Paul, Y. Dunne, and . Chevaleyredunne, The complexity of deciding reachability properties of distributed negotiation schemes The complexity of contract negotiation, and Jon Kleinberg. Networks, Crowds, and Markets: Reasoning about a Highly Connected World, pp.113-14423, 2005.

. Endriss, 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

G. Peter, Assignment problem based on ordinal preferences [Hoefer, 2013] Martin Hoefer. Local matching dynamics in social networks, Management Science Information and Computation, vol.20, issue.222, pp.331-34020, 1973.

W. Tuomas and . Sandholm, Contract types for satisficing task allocation [Shapley and Scarf, 1974] Lloyd Shapley and Herbert Scarf. On cores and indivisibility] Ryo Yoshinaka. Higher-order matching in the linear lambda calculus in the absence of constants is NP-complete, Proceedings of the AAAI Spring Symposium Proceedings of the 16th International Conference on Rewriting Techniques and Applications (RTA), pp.23-2523, 1974.