Privacy preserving learning in negotiation

  • Authors:
  • Sheng Zhang;Fillia Makedon

  • Affiliations:
  • Dartmouth College Hanover, NH;Dartmouth College Hanover, NH

  • Venue:
  • Proceedings of the 2005 ACM symposium on Applied computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Machine learning techniques are widely used in negotiation systems. To get more accurate and satisfactory learning results, negotiation parties have the desire to employ learning techniques on the union of their past negotiation records. However, negotiation records are usually confidential and private, and owners may not want to reveal the details of these records. In this paper, we introduce a privacy preserving negotiation learning scheme that incorporate secure multiparty computation techniques into negotiation learning algorithms to allow negotiation parties to securely complete the learning process on a union of distributed data sets. As an example, a detailed solution for secure negotiation Q-learning is presented based on two secure multiparty computations: weighted mean and maximum. We also introduce a novel protocol for the secure maximum operation.