An application of Lemke's method to a class of Markov decision problems (Q1610179): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4041089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: OPTIMAL STOPPING PROBLEM WITH SEVERAL SEARCH AREAS / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Stochastic Shortest Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5608987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5608986 / rank
 
Normal rank

Latest revision as of 15:03, 4 June 2024

scientific article
Language Label Description Also known as
English
An application of Lemke's method to a class of Markov decision problems
scientific article

    Statements

    An application of Lemke's method to a class of Markov decision problems (English)
    0 references
    0 references
    0 references
    18 August 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    mathematical programming
    0 references
    Markov decision problem
    0 references
    linear complementarity problem
    0 references
    solvability by Lemke's method
    0 references