Privacy-Preserving Strategy for Negotiating Stable, Equitable and Optimal Matchings - Mines Saint-Étienne Access content directly
Conference Papers Year : 2011

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.

Dates and versions

emse-00674789 , version 1 (28-02-2012)

Identifiers

Cite

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⟩
196 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More