On polynomial cases of the unichain classification problem for Markov decision processes (Q957336): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2008.06.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2089363577
@@ Property / OpenAlex ID: W2089363577 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal decision procedures for finite Markov chains. Part III: General convex systems
+Normal rank
@@ Property / cites work @@
+Optimal Node Visitation in Stochastic Digraphs
@@ Property / cites work: Optimal Node Visitation in Stochastic Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finite state Markovian decision processes
@@ Property / cites work: Finite state Markovian decision processes / rank @@
+Normal rank
@@ Property / cites work @@
+Q3237805
@@ Property / cites work: Q3237805 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3266141
@@ Property / cites work: Q3266141 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5463020
@@ Property / cites work: Q5463020 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4547434
@@ Property / cites work: Q4547434 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4273847
@@ Property / cites work: Q4273847 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal control of diffusion processes with reflection
+Normal rank
@@ Property / cites work @@
+NP-hardness of checking the unichain condition in average cost MDPs
+Normal rank