Negotiation on data allocation in multi-agent environments

Rina Azoulay-Schwartz, Sarit Kraus

Research output: Contribution to journalArticlepeer-review

12 Scopus citations


In this paper, we consider the problem of data allocation in environments of self-motivated servers, where information servers respond to queries from users. New data items arrive frequently and have to be allocated in the distributed system. The servers have no common interests, and each server is concerned with the exact location of each of the data items. There is also no central controller. We suggest using a negotiation framework which takes into account the passage of time during the negotiation process itself. Using this negotiation mechanism, the servers have simple and stable negotiation strategies that result in efficient agreements without delays. We provide heuristics for finding the details of the strategies which depend on the specific settings of the environment and which cannot be provided to the agents in advance. We demonstrate the quality of the heuristics, using simulations. We consider situations characterized by complete, as well as incomplete, information and prove that our methods yield better results than the static allocation policy currently used for data allocation for servers in distributed systems.

Original languageEnglish
Pages (from-to)123-172
Number of pages50
JournalAutonomous Agents and Multi-Agent Systems
Issue number2
StatePublished - 2002

Bibliographical note

Funding Information:
∗This material is based upon work supported in part by the NSF under Grant No. IRI-9423967. Rina Azoulay-Schwartz is supported by the Israeli Ministry of Science. Some material in this paper appeared in preliminary form in [51].


Dive into the research topics of 'Negotiation on data allocation in multi-agent environments'. Together they form a unique fingerprint.

Cite this