Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. A Secure and Fair Protocol that Addresses Weaknesses of the Nash Bargaining Solution in Nonlinear Negotiation

A Secure and Fair Protocol that Addresses Weaknesses of the Nash Bargaining Solution in Nonlinear Negotiation

Thumbnail Image
Download
Name

10726_2010_Article_9194.pdf

Size

872.89 KB

Format

Adobe PDF

Checksum (MD5)

bf6948059ed175c81462f3bcea7bceb7

Download all files submitted through automated deposit
art_6045415143812553237.zip (676.67 KB)
Author(s)
Fujita, Katsuhide
•
Ito, Takayuki
•
Klein, Mark
Date Issued
March 2010
Journal
Group Decision and Negotiation
Publisher
Springer Netherlands
Citation
Fujita, Katsuhide, Takayuki Ito, and Mark Klein. “A Secure and Fair Protocol That Addresses Weaknesses of the Nash Bargaining Solution in Nonlinear Negotiation.” Group Decis Negot 21, no. 1 (March 3, 2010): 29–47.
Version
Author's final manuscript
Abstract
Negotiation with multiple interdependent issues is an important problem since much of real-world negotiation falls into this category. This paper examines the problem that, in such domains, agent utility functions are nonlinear, and thereby can create nonconvex Pareto frontiers. This in turn implies that the Nash Bargaining Solution, which has been viewed as the gold standard for identifying a unique optimal negotiation outcome, does not serve that role in nonlinear domains. In nonlinear domains, unlike linear ones, there can be multiple Nash Bargaining Solutions, and all can be sub-optimal with respect to social welfare and fairness. In this paper, we propose a novel negotiation protocol called SFMP (the Secure and Fair Mediator Protocol) that addresses this challenge, enabling secure multilateral negotiations with fair and pareto-optimal outcomes in nonlinear domains. The protocol works by (1) using nonlinear optimization, combined with a Multi-Party protocol, to find the Pareto front without revealing agent’s private utility information, and (2) selecting the agreement from the Pareto set that maximizes a fair division criterion we call approximated fairness. We demonstrate that SFMP is able to find agreements that maximize fairness and social welfare in nonlinear domains, and out-performs (in terms of outcomes and scalability) previously developed nonlinear negotiation protocols.
MIT Department
Massachusetts Institute of Technology. Center for Collective Intelligence
Sloan School of Management
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
http://hdl.handle.net/1721.1/105777
DOI of Published Version
https://doi.org/10.1007/s10726-010-9194-6
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.