A LATTICE‐BASED APPROACH TO THE PROBLEM OF RECRUITMENT IN MULTIAGENT SYSTEMS. (11th September 2012)

• Record Type: Journal Article
• Authors: Amigoni, Francesco; Continanza, Luca
• Is Part Of: Computational intelligence. Volume 29:Number 1(2013:Feb.)
• Page Start: 156
• Page End: 186
• Publication Date: 2012-09-11
• Subjects: Artificial intelligence -- Periodicals; Computational linguistics -- Periodicals; 006.3
• DOI: 10.1111/coin.12001
• Languages: English
• ISSNs: 0824-7935

Abstract

<abstract abstract-type="main" xml:lang="en"> <title> <x xml:space="preserve">Abstract</x> </title> <p>Multiagent systems constitute an independent topic at the intersection between distributed computing and artificial intelligence. As the algorithmic techniques and the applications for multiagent systems have been continuously developing over the last two decades reaching significantly mature stages, many methodological problems have been addressed. In this paper, we aim to contribute to this methodological assessment of multiagent systems by considering the problem of choosing, or recruiting, a subset of agents from a set of available agents to satisfy a given request. This problem, which we call <italic>problem of recruitment</italic>, is encountered, for example, in matchmaking and in task allocation. We present and study a novel formal approach to the problem of recruitment, based on the algebraic formalism of lattices. The resulting formal framework can support the development of algorithms for automatic recruitment.</p> </abstract>