Privacy-Preserving Strategy for Negotiating Stable, Equitable and Optimal Matchings

Abstract : The assignment problem has a wide variety of applications and in particular, it can be applied to any two-sided market. In this paper, we propose a multi-agent framework to distributively solve this kind of assignment problems, by providing agents which negotiate with respect to their preferences. We present here a realisation of the minimal concession strategy. Our realisation of the minimal concession strategy has useful properties: it preserves the privacy and improves the optimality of the solution and the equity amongst the partners.
Complete list of metadatas

https://hal-emse.ccsd.cnrs.fr/emse-00674789
Contributor : Florent Breuil <>
Submitted on : Tuesday, February 28, 2012 - 11:15:20 AM
Last modification on : Thursday, October 17, 2019 - 12:36:11 PM

Links full text

Identifiers

Citation

Maxime Morge, Gauthier Picard. Privacy-Preserving Strategy for Negotiating Stable, Equitable and Optimal Matchings. 9th International Conference on Practical Applications of Agents and Multiagent Systems (PAAMS'11), Apr 2011, Salamanca, Spain. pp.97-102, ⟨10.1007/978-3-642-19875-5_12⟩. ⟨emse-00674789⟩

Share

Metrics

Record views

428