Artificial Intelligence - Special issue: Fuzzy set and possibility theory-based methods in artificial intelligence
An agenda-based framework for multi-issue negotiation
Artificial Intelligence
Learning on opponent's preferences to make effective multi-issue negotiation trade-offs
ICEC '04 Proceedings of the 6th international conference on Electronic commerce
International Journal of Intelligent Systems - Learning Approaches for Negotiation Agents and Automated Negotiation
A Negotiation Meta Strategy Combining Trade-off and Concession Moves
Autonomous Agents and Multi-Agent Systems
Multi-issue negotiation with deadlines
Journal of Artificial Intelligence Research
Multi-issue negotiation protocol for agents: exploring nonlinear utility spaces
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Multi-attribute bilateral bargaining in a one-to-many setting
AAMAS'04 Proceedings of the 6th AAMAS international conference on Agent-Mediated Electronic Commerce: theories for and Engineering of Distributed Mechanisms and Systems
From problems to protocols: Towards a negotiation handbook
Decision Support Systems
Hi-index | 0.00 |
In this paper, we present an automated multi-agent multi-issue negotiation solution to solve a resource allocation problem. We use a multilateral negotiation model, by which three agents bid sequentially in consecutive rounds till some deadline. Two issues are bundled and negotiated concurrently, so win-win opportunities can be generated as trade-offs exist between issues. We develop negotiation strategies of the agents under an incomplete information setting. The strategies are composed of a Pareto-optimal-search method and concession strategies. An important technical contribution of this paper lies in the development of the Pareto-optimal-search method for three-agent multilateral negotiation. Moreover, we present the identification of agreements and Pareto-optimal outcomes achieved by our methods in mathematical proof. We show through computer experiments that using the tractable heuristic of Pareto-optimal-search combined with well-designed concession strategies by agents results in (near) Pareto-optimal outcomes.