Nicolas Maudet

LAMSADE
Univ. Paris 9 Dauphine
75775 Paris Cedex 16
maudet[at]lamsade.dauphine.fr
(anti-spam [at] for @)

• Home
• Enseignement
• Collaborations
• Publications
• Events

Publications

• by Date • by Publication Type • by Research Category •

Multiagent Resource Allocation in k-additive Domains: Preference Representation and Complexity

Yann Chevaleyre, Ulle Endriss, Sylvia Estivie, and Nicolas Maudet. Multiagent Resource Allocation in k-additive Domains: Preference Representation and Complexity. Annals of Operations Research, 163(1):49–62, 2008.

Download

[PDF] 

Abstract

We study a framework for multiagent resource allocation where autonomous software agents negotiate over the allocation of bundles of indivisible resources. Connections to well-known combinatorial optimisation problems, including the winner determination problem in combinatorial auctions, shed light on the computational complexity of the framework. We give particular consideration to scenarios where the preferences of agents are modelled in terms of k-additive utility functions, i.e. scenarios where synergies between different resources are restricted to bundles of at most k items.

@article{ChevaleyreEtAlAOR2008,
  author =        {Yann Chevaleyre and Ulle Endriss and Sylvia Estivie and Nicolas Maudet},
  title =         {Multiagent Resource Allocation in k-additive Domains: Preference Representation and Complexity},
  journal =       {Annals of Operations Research},
  year =          {2008},
  volume =        {163},
  number =        {1}, 
  pages =         {49--62}, 
  abstract = {We study a framework for multiagent resource allocation where autonomous software agents negotiate over the allocation of bundles of indivisible resources. Connections to well-known combinatorial optimisation problems, including the winner determination problem in combinatorial auctions, shed light on the computational complexity of the framework. We give particular consideration to scenarios where the preferences of agents are modelled in terms of k-additive utility functions, i.e. scenarios where synergies between different resources are restricted to bundles of at most k items.}
}

Generated by bib2html.pl (written by Patrick Riley ) on Mon May 09, 2011 17:34:33