Advertisement

Optimal Preference Clustering Technique for Scalable Multiagent Negotiation(Short Paper)

  • Raiye Hailu
  • Takayuki Ito
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8481)

Abstract

We propose protocol for automated negotiations between multiple agents over multiple and interdependent issues. We consider the situation in which the agents have to agree upon one option (contract) among many possible ones (contract space). Interdependency between issues prevents us from applying negotiation protocols that have linear time complexity cost like Hill Climbing implementing mediated text negotiation protocol(HC). As a result most previous works propose methods in which the agents use non linear optimizers like simulated annealing to generate proposals. Then a central mediator can be used to match the proposals in order to find an intersection. But this matching process usually has exponential time cost complexity. We propose multi round HC(MR-HC) for negotiations with multiple and interdependent issues. In each round the normal HC is used to determine a negotiation deal region to be used by the next round. We propose that the agents should cluster their constraints by the cardinality of the constraints in order to get socially optimal contracts before applying MR-HC. To showcase that our proposed clustering technique is an essential one, we evaluate the optimality of our proposed protocol by running simulations at different cluster sizes.

Keywords

Artificial Intelligence Distributed Artificial Intelligence Coherence and Coordination Automated Negotiation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ito, H.H., Klein: Multi-issue negotiation protocol for agents exploring nonlinear utility spaces. In: International Joint Conference on Artificial Intelligence (2007)Google Scholar
  2. 2.
    Hattori, M.K., Ito: Using Iterative Narrowing to Enable Multi-Party Negotiations with Multiple Interdependent Issues. In: Autonomous Agents and Multi Agents Systems (2007)Google Scholar
  3. 3.
    Ito, H.H., Klein: Multi-issue negotiation protocol for agents exploring nonlinear utility spaces. In: International Joint Conference on Artificial Intelligence (2007)Google Scholar
  4. 4.
    Lopez-Carmona, Marsa-Maestre, I., Hoz, Velasco, J.: A region based multi issue negotiation protocol for non monotonic utility spaces. Studies in Computational Intelligence 27, 166–217 (2011)CrossRefzbMATHGoogle Scholar
  5. 5.
    Fujita, T.I., Klein: An Approach to Scalable Multi-issue Negotiation: Decomposing the Contract Space Based on Issue Interdependencies. In: Intelligent Agent Technology (2010)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Raiye Hailu
    • 1
  • Takayuki Ito
    • 1
  1. 1.Nagoya Institute of TechnologyNagoyaJapan

Personalised recommendations