Restricted Classes of Utility Functions for Simple Negotiation Schemes: Sufficiency, Necessity, and Maximality

Yann Chevaleyre (1) , Ulle Endriss (2) , Nicolas Maudet (1)

1 LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision
2 Department of Computing [London]

We investigate the properties of an abstract negotiation framework where agents autonomously negotiate over allocations of discrete resources. In this framework, reaching an optimal allocation potentially requires very complex multilateral deals. Therefore, we are interested in identifying classes of utility functions such that any negotiation conducted by means of deals involving only a single resource at at time is bound to converge to an optimal allocation whenever all agents model their preferences using these functions. We show that the class of modular utility functions is not only sufficient (when side-payments are allowed) but also maximal in this sense. A similar result is proven in the context of negotiation without money.

Mots clés: Allocation de Ressources Distribuée; Négociation Automatique; Multiagent Resource Allocation; Negotiation

Domaines: Complexité [cs.CC]; Recherche opérationnelle [math.OC]

Yann Chevaleyre, Ulle Endriss, Nicolas Maudet. Restricted Classes of Utility Functions for Simple Negotiation Schemes: Sufficiency, Necessity, and Maximality. 2006. ⟨hal-00116629⟩