Efficient computation of a canonical form for a matrix with the generalized P-property

DOI10.1007/s10107-014-0802-0zbMath1327.90338arXiv1204.6345OpenAlexW2043366494MaRDI QIDQ747763

Walter D. jun. Morris

Publication date: 19 October 2015

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.6345

zbMATH Keywords

linear programmingpolytopeP-matrixMarkov decision problem

Mathematics Subject Classification ID

Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Stochastic games, stochastic differential games (91A15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unique sink orientations of grids
• Good hidden \(P\)-matrix sandwiches
• Existence and uniqueness of solutions for the generalized linear complementarity problem
• Klee-Minty's LP and upper bounds for Dantzig's simplex method
• Pivoting in linear complementarity: Two polynomial-time cases
• The Simplex and Policy-Iteration Methods Are Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate
• Geometric Properties of Hidden Minkowski Matrices
• Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor
• A generalization of the linear complementarity problem
• A New Complexity Result on Solving the Markov Decision Problem

This page was built for publication: Efficient computation of a canonical form for a matrix with the generalized P-property