Efficient Computation of a Canonical Form for a Generalized P-matrix

TL;DR

This paper demonstrates that a canonical form for a generalized P-matrix can be computed efficiently using recent algorithms for Markov decision problems, achieving strongly polynomial time in key cases.

Contribution

It introduces a method to compute a canonical form for generalized P-matrices leveraging advances in Markov decision problem algorithms, with strong polynomial guarantees.

Findings

Canonical form can be computed efficiently in important cases.

Uses recent Markov decision problem algorithms.

Achieves strongly polynomial time complexity.

Abstract

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.