Approximately fair and secure protocols for multiple interdependent issues negotiation

Authors:
Katsuhide Fujita;Takayuki Ito;Mark Klein
Affiliations:
Nagoya Institute of Technology, Nagoya, Japan;Center for Collective Intelligence, Cambridge;Center for Collective Intelligence, Cambridge
Venue:
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Year:
2009

Citing 2
Cited 2

How to share a secret

Communications of the ACM
Multi-issue negotiation protocol for agents: exploring nonlinear utility spaces

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence

A Secure and Fair Negotiation Protocol in Highly Complex Utility Space Based on Cone-Constraints

WI-IAT '09 Proceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 02
Evaluating practical negotiating agents: Results and analysis of the 2011 international competition

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Multi-issue negotiation has been studied widely. Our work focuses on the important special case of negotiation with multiple interdependent issues, in which agent utility functions are nonlinear. In this paper, we propose a Distributed Mediator Protocol (DMP) for securely finding Pareto optimal agreements. We also propose a measure for selecting final agreements from the set of Pareto-optimal contracts, based on "approximated fairness" and the "rate of Nash bargaining solution". We demonstrate that the DMP finds the Nash bargaining solution better than previous work in this area.