Dynamic task delegation for hierarchical agents
Abstract
This is the fourth installment in a series of papers offering models of hierarchical structure for dynamical systems, using the language of polynomial functors. The operad underlying the symmetric monoidal category can be viewed as defining the behavior of hierarchical delegation. In particular, a morphism turns the outputs of subordinates with interfaces into the output of an agent with interface and turns a task given to the agent into a task for each of the subordinates. In this article, we extend the framework so that subordinates may be invoked asynchronously depending on the outcomes of other subordinates. We prove that the free (co)monad (co)monad extends to a (co)monad on . From the perspective of programs/pattern, this extension implies the existence of a -enriched operad , and from the perspective of behavior/matter, it implies the existence of a -enriched operad . Second, we crispen the relationship between the programmatic and behavioral perspectives via a functor for any polynomial monad .
Keywords
Cite
@article{arxiv.2410.08373,
title = {Dynamic task delegation for hierarchical agents},
author = {Sophie Libkind and David I. Spivak},
journal= {arXiv preprint arXiv:2410.08373},
year = {2024}
}
Comments
In Definition 3.7, for there to be an operad underlying the Kleisli category assumes that the Kleisli category is monoidal with respect to $\vee$. However, the Kleisli category is pre-monoidal and not monoidal with respect to $\vee$