R-theory for countable reducible nonnegative matrices

DOI10.1080/17442508308833275zbMath0548.60069OpenAlexW4254438101MaRDI QIDQ3339886

No author found.

Publication date: 1983

Published in: Stochastics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/17442508308833275

zbMATH Keywords

optimization problems\(\beta\) -excessive positive functionreducible non-negative matrices

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Probabilistic potential theory (60J45) Stochastic matrices (15B51)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic eigenspaces of nonnegative matrices
• Markov programming by successive approximations with respect to weighted supremum norms
• Markov decision processes and strongly excessive functions
• Ergodic properties of nonnegative matrices. I
• GEOMETRIC ERGODICITY IN DENUMERABLE MARKOV CHAINS
• On sets of countable non-negative matrices and Markov decision processes
• THE THEORY OF NON‐NEGATIVE MATRICES IN A DYNAMIC PROGRAMMING PROBLEM
• Truncation procedures for non-negative matrices

This page was built for publication: R-theory for countable reducible nonnegative matrices