Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.3/205179

Title

An efficient protocol for negotiation over combinatorial domains with incomplete information

Author(s)

Li, Minyi;  Vo, Quoc Bao;  Kowalczyk, Ryszard

Abstract

We study the problem of agent-based negotiation in combinatorial domains. It is difficult to reach optimal agreements in bilateral or multi-lateral negotiations when the agents' preferences for the possible alternatives are not common knowledge. Self-interested agents often end up negotiating inefficient agreements in such situations. In this paper, we present a protocol for negotiation in combinatorial domains which can lead rational agents to reach optimal agreements under incomplete information setting. Our proposed protocol enables the negotiating agents to identify efficient solutions using distributed search that visits only a small subspace of the whole outcome space. Moreover, the proposed protocol is sufficiently general that it is applicable to most preference representation models in combinatorial domains. We also present results of experiments that demonstrate the feasibility and computational efficiency of our approach.

Publication type

Conference paper

Research centre

Swinburne University of Technology. Faculty of Information and Communication Technologies

Source

Proceedings of the 27th Conference on Uncertainty in Artificial Intelligence (UAI 2011), Barcelona, Spain, 14-17 July 2011 / Fabio G. Cozman and Avi Pfeffer (eds.), pp. 436-444

Publication year

2011

Keyword(s)

Agent-based negotiation

Publisher

AUAI Press

ISBN

9780974903972, 0974903973

Publisher URL

http://uai.sis.pitt.edu/displayArticleDetails.jsp?mmnu=2&smnu=2&article_id=2189&author_id=1843

Copyright

Copyright © 2011.

Research Projects

Responsive automated negotiation in open distributed environments, Australian Research Council grant number DP110103671

Peer reviewed