Conditions for the solvability of the linear programming formulation for constrained discounted Markov decision processes (Q315764): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00245-015-9307-3 / rank
Normal rank
 
Property / author
 
Property / author: François Dufour / rank
Normal rank
 
Property / author
 
Property / author: Tomás Prieto-Rumeau / rank
Normal rank
 
Property / author
 
Property / author: François Dufour / rank
 
Normal rank
Property / author
 
Property / author: Tomás Prieto-Rumeau / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C40 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 60J05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6629424 / rank
 
Normal rank
Property / zbMATH Keywords
 
Markov decision processes
Property / zbMATH Keywords: Markov decision processes / rank
 
Normal rank
Property / zbMATH Keywords
 
linear programming formulation
Property / zbMATH Keywords: linear programming formulation / rank
 
Normal rank
Property / zbMATH Keywords
 
constrained problems
Property / zbMATH Keywords: constrained problems / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00245-015-9307-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1200801359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5386174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3066192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On compactness of the space of policies in stochastic dynamic programming / 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: Q4547443 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of Markov decision processes with general state space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting Randomized Stationary Policies in Total-Reward Markov Decision Processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic finance. An introduction in discrete time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2736598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained Markov control processes in Borel spaces: the discounted case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5599448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4323294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3832355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dynamic programming: Compactness of the space of policies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5531123 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00245-015-9307-3 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:12, 9 December 2024

scientific article
Language Label Description Also known as
English
Conditions for the solvability of the linear programming formulation for constrained discounted Markov decision processes
scientific article

    Statements

    Conditions for the solvability of the linear programming formulation for constrained discounted Markov decision processes (English)
    0 references
    0 references
    0 references
    23 September 2016
    0 references
    Markov decision processes
    0 references
    linear programming formulation
    0 references
    constrained problems
    0 references

    Identifiers