Our work examines the controlled agreement problem over a network of interconnected dynamic units. The agreement protocol has recently been a focus of a large number of research work in systems and control community. Most of the existing work in this area, however, consider the uncontrolled agreement protocol. In this work, we consider the controlled agreement problem and introduce algebraic and graph theoretic conditions for its controllability. We then proceed to provide a graphical interpretation of these controllability conditions. In addition, we explore the role of anchored vertex position in the information structure to improve the convergence properties of the controlled agreement protocol