A multi-choice offer strategy for bilateral multi-issue negotiations using modified DWM learning

  • Authors:
  • Hae Young Noh;Kivanc Ozonat;Sharad Singhal;Yinping Yang

  • Affiliations:
  • Stanford University, Stanford, CA;Hewlett-Packard Laboratories, Palo Alto, CA;Hewlett-Packard Laboratories, Palo Alto, CA;IHPC, Agency for Science, Technology, and Research, Singapore

  • Venue:
  • Proceedings of the 13th International Conference on Electronic Commerce
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper introduces a "multi-choice" offer strategy for an automated agent conducting bilateral multi-issue negotiations in an agent-to-human negotiation setting. Assuming that a rational human counterpart is more likely to concede on less important issues, we developed a modified dynamic weighted majority (DWM) learning algorithm for the negotiation agent to estimate the issue weights and issue ranks of the human counterpart. The agent then utilizes these estimates to strategically propose counter-offers with multiple choices to the human counterpart. This strategy allows the agent to expedite the negotiation process and increase the chance of agreement by improving the satisfaction level of the counterpart. We validated this offer strategy using two sets of buyer behavior data: one simulated based on time-dependent behavior models used in the literature, and another collected from a human experiment on automated negotiations. Results indicate that, when compared to other offer strategies described in the literature with similar learning speeds, (i) the modified DWM-based learning algorithm estimates the counterpart's issue weight/rank more accurately, and (ii) the multi-choice offer strategy utilizing the learning algorithm makes more attractive offers to the counterpart while maintaining the same utility for the agent.