A method of bisection for discounted Markov decision problems (Q4199858): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction Mappings in the Theory Underlying Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified dynamic programming method for Markovian decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter to the Editor—A Test for Suboptimal Actions in Markovian Decision Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Bounds for Discounted Sequential Decision Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified Policy Iteration Algorithms for Discounted Markov Decision Problems / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01954692 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2084500468 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:52, 30 July 2024

scientific article; zbMATH DE number 3641218
Language Label Description Also known as
English
A method of bisection for discounted Markov decision problems
scientific article; zbMATH DE number 3641218

    Statements

    A method of bisection for discounted Markov decision problems (English)
    0 references
    0 references
    1979
    0 references
    comparison of algorithms
    0 references
    dynamic programming
    0 references
    value iteration
    0 references
    bisection method
    0 references
    stationary Markov decision process
    0 references
    infinite horizon
    0 references
    numerical examples
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references