We consider the problem of strong coordination over several three-agent
networks, such as line, broadcast, and multiple-access networks. Coordination is
specified by a joint distribution between the actions of the agents, and the
objective is to identify the minimum communication between agents required to
achieve the prescribed joint distribution. We establish inner and outer bounds
on the coordination capacity rate region for these networks, using achievability
proofs that leverage results for multiple-access channel resolvability and for
strong secrecy over wiretap channels. We show how these results provide insight
into the interplay between network topology and coordination.