Z. Abbassi, L. V. Lakshmanan, and M. Xie, Fair recommendations for online barter exchange networks, Proc. 16th International Workshop on the Web and Databases (WebDB), 2013.

D. J. Abraham, A. Blum, and T. Sandholm, Clearing algorithms for barter exchange markets, Proceedings of the 8th ACM conference on Electronic commerce , EC '07, pp.295-304, 2007.
DOI : 10.1145/1250910.1250954

D. J. Abraham, K. Cechlárová, D. F. Manlove, and K. Mehlhorn, Pareto Optimality in House Allocation Problems, Algorithms and Computation, pp.3-15, 2005.
DOI : 10.1007/978-3-540-30551-4_3

H. Ackermann, P. W. Goldberg, V. S. Mirrokni, H. Röglin, and B. Vöcking, Uncoordinated Two-Sided Matching Markets, SIAM Journal on Computing, vol.40, issue.1, pp.92-106, 2011.
DOI : 10.1137/090753498

E. Anshelevich, S. Das, and Y. Naamad, Anarchy, stability, and utopia: creating better matchings, Autonomous Agents and Multi-Agent Systems, vol.393, issue.6684, pp.120-140, 2013.
DOI : 10.1007/s10458-011-9184-3

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.232.7427

M. A. Ballester and G. Haeringer, A characterization of the single-peaked domain, Social Choice and Welfare, vol.17, issue.3, pp.305-322, 2011.
DOI : 10.1007/s00355-010-0476-3

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

P. E. Dunne, Extremal behaviour in multiagent contract negotiation, Journal of Artificial Intelligence Research, vol.23, pp.41-78, 2005.

R. S. Garfinkel, An improved algorithm for the bottleneck assignment problem, Operations Research, pp.1747-1751, 1971.

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

J. L. Hougaard, J. D. Moreno-ternero, and L. P. , Assigning agents to a line, Games and Economic Behavior, vol.87, pp.539-553, 2014.
DOI : 10.1016/j.geb.2014.02.011

J. Ma, Strategy-proofness and the strict core in a market with indivisibilities, International Journal of Game Theory, vol.42, issue.4, pp.75-83, 1994.
DOI : 10.1007/BF01242849

N. Mattei and T. Walsh, Preflib: A library of preference data, Proceedings of Third International Conference on Algorithmic Decision Theory, 2013.

J. Plesnik, The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two, SIAM Journal on Computing, vol.8, issue.4, pp.199-201, 1979.

J. S. Rosenschein and G. Zlotkin, Rules of Encounter, 1994.

A. Roth, T. Sonmez, and U. Unver, Pairwise kidney exchange, Journal of Economic Theory, vol.125, issue.2, pp.151-188, 2005.
DOI : 10.1016/j.jet.2005.04.004

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.307.7420

A. E. Roth and J. H. Vate, Random Paths to Stability in Two-Sided Matching, Econometrica, vol.58, issue.6, pp.1475-1480, 1990.
DOI : 10.2307/2938326

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

A. K. Sen, A Possibility Theorem on Majority Decisions, Econometrica, vol.34, issue.2, pp.491-499, 1966.
DOI : 10.2307/1909947

L. Shapley and H. Scarf, On cores and indivisibility, Journal of Mathematical Economics, vol.1, issue.1, pp.23-37, 1974.
DOI : 10.1016/0304-4068(74)90033-0