Pseudo-Youden designs balanced for intersection

If the row–column intersections of a row–column design A form a balanced incomplete block design, then A is said to be balanced for intersection. This property was originally defined for triple arrays by McSorley et al. (2005a), Section 8, where an example was presented and questions of existence were raised and discussed. We give sufficient conditions for the class of balanced grids in order to be balanced for intersection, and prove that a family of binary pseudo-Youden designs has this property.