Efficient Computation of a Canonical Form for a Generalized P-matrix
  We use recent results on algorithms for Markov decision problems to show that a canonical form for a generalized P-matrix can be computed, in some important cases, by a strongly polynomial algorithm. 
Walter D. Morris Jr
math.OC