Symbolic Negotiation with Linear Logic

Abstract. Negotiation over resources and multi-agent planning are important issues in multi-agent systems research. It has been demonstrated [19] how symbolic negotiation and distributed planning together could be formalised as distributed Linear Logic (LL) theorem proving. LL has been chosen mainly because of its expressive power for representation of resources and its computation-oriented nature. This paper extends the previous work by taking advantage of a richer fragment of LL and introducing two sorts of nondeterministic choices into negotiation. This allows agents to reason and negotiate under certain degree of uncertainty. Additionally, a way of granting unbounded access to resources during negotiation is considered. Finally we extend our framework with first-order LL for expressing more complex offers during negotiation.

• Type: Conference
• Year: 2004
• Where: CLIMA
• Authors: Peep Küngas, Mihhail Matskin
• Keywords: CLIMA 2004, CLIMA 2007, Multi-agent Systems Research, Negotiation, Symbolic Negotiation