<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>06105878</id>
  <dt>a</dt>
  <an>06105878</an>
  <augroup>
    <au>Hao, Jianye</au>
    <au>Leung, Ho-fung</au>
  </augroup>
  <ti>An efficient negotiation protocol to achieve socially optimal allocation.</ti>
  <so>Rahwan, Iyad (ed.) et al., PRIMA 2012: Principles and practice of multi-agent systems. 15th international conference, Kuching, Sarawak, Malaysia, September 3--7, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32728-5/pbk). Lecture Notes in Computer Science 7455. Lecture Notes in Artificial Intelligence, 46-60 (2012).</so>
  <py>2012</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-642-32729-2_4</li>
  </ligroup>
  <abgroup>
    <ab>Summary: Negotiation-based resource allocation among agents is an important topic in multi-agent system research and it can be applied in various practical domains including network bandwidth allocation, robotics and grid computing. However, it is quite challenging to achieve efficient negotiation due to the huge space of all possible deals. A number of negotiation protocols have been proposed to guide the agents to reach desirable allocations over resources. However, previous work puts too much constraints on the negotiation environment and thus limits its applicability. To address this limitation, we present an efficient protocol within a more general negotiation framework, which can lead agents to achieve socially optimal allocation. We theoretically prove that the final allocation is guaranteed to be socially optimal provided that the agents are altruistic-individually rational. Besides, extensive simulation results show that the complexities of the negotiation process are greatly reduced under our protocol from both communication and computational aspects.</ab>
    <rv></rv>
  </abgroup>
</item>