Print Email Facebook Twitter Efficient Methods for Multi-agent Multi-issue Negotiation: Allocating Resources Title Efficient Methods for Multi-agent Multi-issue Negotiation: Allocating Resources Author Wu, M. De Weerdt, M.M. La Poutré, H. Faculty Electrical Engineering, Mathematics and Computer Science Department Software Computer Technology Date 2009-12-31 Abstract 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. To reference this document use: http://resolver.tudelft.nl/uuid:9b2deeee-603c-492c-a089-f682736dc775 Publisher Springer Source https://doi.org/doi:10.1007/978-3-642-11161-7_7 Source Lecture Notes in Computer Science, 5925, 2009; authors version Part of collection Institutional Repository Document type book chapter Rights (c) 2010 SpringerThe original publication is available at www.springerlink.com Files PDF prima091.pdf 1.3 MB Close viewer /islandora/object/uuid%3A9b2deeee-603c-492c-a089-f682736dc775/datastream/OBJ/view