Finding a feasible solution for a class of distributed problems with a single sum constraint using agents
Redirect to publisher's version
(publisher's version.url.txt, 41 bytes)
In this paper, we describe a Multi-Agent System which is capable of finding a feasible solution of a class of distributed problems, in which the subproblems share a single a sum constraint. Emphasis is given to correctness issues and termination detection.