The leader-following consensus problem for linear discrete-time multiagent systems has been studied in the literature using H-infinity Riccati inequality design and H-2 Riccati equation design methods, respectively. These two methods lead to a solvability condition in terms of an inequality that relies on a scaling gain and a fixed weighting vector called nominal weighting vector. In this paper, we further study this problem by proposing a more general class of distributed state feedback control laws, which not only depends on a scaling gain, but also a set of weighting vectors. We first establish a spectral property of a weighted graph matrix, which will be instrumental in solving the problem. Then, we present a solvability condition based on a modified algebraic Riccati equation, which is somehow more general than H-infinity and H-2 Riccati methods, in that the solvability condition can be made satisfied by tuning the weighting vector. We show that our solvability condition is also necessary for single-input follower systems and is always satisfied for leader systems without exponentially growing modes. Moreover, in case the solvability condition is not satisfied under the nominal weighting vector, we show that our solvability condition can always be made satisfied by choosing a weighting vector other than the nominal one for multiagent systems over acyclic digraphs.