The University of Southampton
University of Southampton Institutional Repository

Forming efficient agent groups for completing complex tasks

Forming efficient agent groups for completing complex tasks
Forming efficient agent groups for completing complex tasks
In this paper we produce complexity and impossibility results and develop algorithms for a task allocation problem that needs to be solved by a group of autonomous agents working together. In particular, each task is assumed to be composed of several subtasks and involves an associated predetermined and known overall payment (set by the task’s owner) for its completion. However, the division of this payment among the corresponding contributors is not predefined. Now to accomplish a particular task, all its subtasks need to be allocated to agents with the necessary capabilities and the agents’ corresponding costs need to fall within the preset overall task payment. For this scenario, we first provide a cooperative agent system designer with a practical solution that achieves an efficient allocation. However, this solution is not applicable for non-cooperative settings. Consequently, we go on to provide a detailed analysis where we prove that certain design goals cannot be achieved if the agents are self interested. Specifically, we prove that for the general case, no protocol achieving the efficient solution can exist that is individually rational and budget balanced. We show that although efficient protocols may exist in some settings, these will inevitably be setting-specific.
Complex Task Allocation, Efficient Allocation
834-841
Manisterski, E.
eb7af07f-f0a0-4e41-9970-e5cdfd926525
David, E.
50a83b47-a498-4536-8947-37a5f6cf7fba
Kraus, S.
eb23baab-f111-4bd4-8318-e1520fb89266
Jennings, N. R.
ab3d94cc-247c-4545-9d1e-65873d6cdb30
Manisterski, E.
eb7af07f-f0a0-4e41-9970-e5cdfd926525
David, E.
50a83b47-a498-4536-8947-37a5f6cf7fba
Kraus, S.
eb23baab-f111-4bd4-8318-e1520fb89266
Jennings, N. R.
ab3d94cc-247c-4545-9d1e-65873d6cdb30

Manisterski, E., David, E., Kraus, S. and Jennings, N. R. (2006) Forming efficient agent groups for completing complex tasks. 5th Int. conf. on Autonomous Agents and Multi-Agent Systems, Japan. pp. 834-841 .

Record type: Conference or Workshop Item (Paper)

Abstract

In this paper we produce complexity and impossibility results and develop algorithms for a task allocation problem that needs to be solved by a group of autonomous agents working together. In particular, each task is assumed to be composed of several subtasks and involves an associated predetermined and known overall payment (set by the task’s owner) for its completion. However, the division of this payment among the corresponding contributors is not predefined. Now to accomplish a particular task, all its subtasks need to be allocated to agents with the necessary capabilities and the agents’ corresponding costs need to fall within the preset overall task payment. For this scenario, we first provide a cooperative agent system designer with a practical solution that achieves an efficient allocation. However, this solution is not applicable for non-cooperative settings. Consequently, we go on to provide a detailed analysis where we prove that certain design goals cannot be achieved if the agents are self interested. Specifically, we prove that for the general case, no protocol achieving the efficient solution can exist that is individually rational and budget balanced. We show that although efficient protocols may exist in some settings, these will inevitably be setting-specific.

Text
etty.aamas06.pdf - Other
Download (178kB)

More information

Published date: 2006
Venue - Dates: 5th Int. conf. on Autonomous Agents and Multi-Agent Systems, Japan, 2006-01-01
Keywords: Complex Task Allocation, Efficient Allocation
Organisations: Agents, Interactions & Complexity

Identifiers

Local EPrints ID: 262592
URI: http://eprints.soton.ac.uk/id/eprint/262592
PURE UUID: b8836ba6-1d32-44dd-83a5-30c7fb703cad

Catalogue record

Date deposited: 16 May 2006
Last modified: 16 Dec 2019 20:43

Export record

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×