Optimal agent cooperation: How many is enough?

Jan De Mot, Eric Feron

Research output: Chapter in Book/Report/Conference proceedingConference contribution


In this paper, we study a simple though non-trivial agent cooperation problem on a structured partially unknown graph whereby the agents observe and share local environment information. We use a recently developed efficient algorithm to compute optimal two- and three-agent policies. We obtain rigorous results on the performance of agent groups as function of the group size. Furthermore, we propose to split up larger agent groups in smaller sized subgroups, each employing an optimal policy suited for its size. We obtain an estimate for the resulting optimality gap and illustrate that for some problem specifics, three-agent subgroups suffice for reasonably small optimality gaps.
Original languageEnglish (US)
Title of host publication43rd Annual Allerton Conference on Communication, Control and Computing 2005
PublisherUniversity of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering
Number of pages8
ISBN (Print)9781604234916
StatePublished - Jan 1 2005
Externally publishedYes


Dive into the research topics of 'Optimal agent cooperation: How many is enough?'. Together they form a unique fingerprint.

Cite this