Approximately fair and secure protocols for multiple interdependent issues negotiation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Approximately fair and secure protocols for multiple interdependent issues negotiation

Full text

Pdf (248 KB)

Source

International Conference on Autonomous Agents archive
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 table of contents

Budapest, Hungary

SESSION: Interactions table of contents

Pages 1287-1288

Year of Publication: 2009

ISBN:978-0-9817381-7-8

Authors

Katsuhide Fujita	Nagoya Institute of Technology, Nagoya, Japan
Takayuki Ito	Center for Collective Intelligence, Cambridge
Mark Klein	Center for Collective Intelligence, Cambridge

Sponsors

: The Foundation for Intelligent Physical Agents
Microsoft Research : Microsoft Research
: Whitestein Technologies
: European Office of Aerospace Research and Development, Air Force Office of Scientific Research, United States Air Force Research Laboratory
: Drexel University
: Wiley -- Blackwell Ltd

Publisher

International Foundation for Autonomous Agents and Multiagent Systems Richland, SC

Bibliometrics

Downloads (6 Weeks): 11, Downloads (12 Months): 20, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

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.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Katsuhide Fujita , Takayuki Ito , Mark Klein, Preliminary Result on Secure Protocols for Multiple Issue Negotiation Problems, Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems, p.161-172, December 15-16, 2008, Hanoi, Vietnam [doi>10.1007/978-3-540-89674-6_19]
	2	T. Ito, H. Hattori, and M. Klein. Multi-issue negotiation protocol for agents: Exploring nonlinear utility spaces. In Proc. of IJCAI-2007, pages 1347--1352, 2007.
	3	Adi Shamir, How to share a secret, Communications of the ACM, v.22 n.11, p.612-613, Nov. 1979 [doi>10.1145/359168.359176]