Iterative algorithms for solving undiscounted bellman equations (Q3032902): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Applications of fixed-point methods to discrete variational and quasi- variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic optimal control. The discrete time case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction mappings underlying undiscounted Markov decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4086303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3266141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative solution of the functional equations of undiscounted Markov renewal programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal stopping time problem with time average cost in a bounded interval / rank
 
Normal rank
Property / cites work
 
Property / cites work: Singular control problems in bounded intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming, Markov chains, and the method of successive approximations / rank
 
Normal rank

Latest revision as of 12:18, 20 June 2024

scientific article
Language Label Description Also known as
English
Iterative algorithms for solving undiscounted bellman equations
scientific article

    Statements