<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet href="client.xsl" type="text/xsl"?>
<article article-type="other">
<front>
<journal-meta>
<journal-id/>
<issn/>
<banner>
<!--<href>banner.jpg</href>-->
<size width="100%"/>
</banner>
</journal-meta>
<article-meta>
<title-group>
<article-title>Dynamic Task Allocation within an Open Service-Oriented MAS Architecture</article-title>
</title-group>

<author><a href="mailto:iju@info.fundp.ac.be"><name>Ivan J. Jureta</name></a></author>
<aff>Information Management Research Unit (IMRU), University of Namur, Belgium</aff>

<author><a href="mailto:sfaulkne@fundp.ac.be"><name>Stephane Faulkner</name></a></author>
<aff>Information Management Research Unit (IMRU), University of Namur, Belgium</aff>

<author><a href="mailto:youssef.achbany@uclouvain.be"><name>Youssef Achbany</name></a></author>
<aff>Information Systems Research Unit (ISYS), Universite de Louvain, Belgium</aff>

<author><a href="mailto:marco.saerens@uclouvain.be"><name>Marco Saerens</name></a></author>
<aff>Information Systems Research Unit (ISYS), Universite de Louvain, Belgium</aff>

</article-meta></front>
<body>
<abstract>
<title>ABSTRACT</title>
<p>A MAS architecture consisting of service centers is proposed. Within each service center, a mediator coordinates service delivery by allocating individual tasks to corresponding task specialist agents depending on their prior perfomance while anticipating performance of newly entering agents. By basing mediator behavior on a novel multicriteria-driven (including quality of service, deadline, reputation, cost, and user preferences) reinforcement learning algorithm, integrating the exploitation of acquired knowledge with optimal, undirected, continual exploration, adaptability to changes in agent availability and performance is ensured. The reported experiments indicate the algorithm behaves as expected and outperforms two standard approaches.</p>
</abstract>
<fpdf>
<href>pdflogo.jpg</href>
<hpdf>AAMAS07_0080_20cc7843a362535605ac05d9b414837a</hpdf>
</fpdf>
</body>
</article>
