Hostname: page-component-586b7cd67f-2brh9 Total loading time: 0 Render date: 2024-11-24T20:54:33.819Z Has data issue: false hasContentIssue false
  • English
  • Français

Multiagent resource allocation

Published online by Cambridge University Press:  23 January 2006

YANN CHEVALEYRE ,
PAUL E. DUNNE ,
ULLE ENDRISS ,
JÉRÔME LANG ,
NICOLAS MAUDET  and
JUAN A. RODRÍGUEZ-AGUILAR
YANN CHEVALEYRE
Affiliation:
LAMSADE, Université Paris-Dauphine, 75775 Paris Cedex 16, France; E-mail: [email protected], [email protected]
PAUL E. DUNNE
Affiliation:
Department of Computer Science, University of Liverpool, Liverpool L69 7ZF, UK; E-mail: [email protected]
ULLE ENDRISS
Affiliation:
ILLC, Universiteit van Amsterdam, 1018 TV Amsterdam, The Netherlands; E-mail: [email protected]
JÉRÔME LANG
Affiliation:
IRIT, Université Paul-Sabatier, 31062 Toulouse Cedex 4, France; E-mail: [email protected]
NICOLAS MAUDET
Affiliation:
LAMSADE, Université Paris-Dauphine, 75775 Paris Cedex 16, France; E-mail: [email protected], [email protected]
JUAN A. RODRÍGUEZ-AGUILAR
Affiliation:
Artificial Intelligence Research Institute (IIIA-CSIC), 08193 Bellaterra, Barcelona, Spain; E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

Resource allocation in multiagent systems is a central research issue in the AgentLink community. The aim of the Technical Forum Group on Multiagent Resource Allocation (TFG-MARA) is to provide a venue for the exchange of ideas in this area and to foster collaboration between different research groups. In this article we report on the first meeting of TFG-MARA, which was held as part of the Second AgentLink III Technical Forum in Ljubljana.

Type
Research Article
Information
The Knowledge Engineering Review , Volume 20 , Issue 2 , June 2005 , pp. 143 - 149
Copyright
2005 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)