A Convex Programming Approach for Discrete-Time Markov Decision Processes under the Expected Total Reward Criterion (Q5130923): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: François Dufour / rank
Normal rank
 
Property / author
 
Property / author: François Dufour / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1903.08853 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5386174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873244 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4264741 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convexity and Optimization in Banach Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convex analytic approach to Markov decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547443 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Expected Total Cost Criterion for Markov Decision Processes under Constraints: A Convex Analytic Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Expected Total Cost Criterion for Markov Decision Processes under Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4547438 / 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: Q4863593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained Markov Decision Processes with Expected Total Reward Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3832355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4377607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Examples in Markov Decision Processes / 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: Stationary Policies in Dynamic Programming Models Under Compactness Assumptions / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2924486842 / rank
 
Normal rank

Latest revision as of 11:32, 30 July 2024

scientific article; zbMATH DE number 7268456
Language Label Description Also known as
English
A Convex Programming Approach for Discrete-Time Markov Decision Processes under the Expected Total Reward Criterion
scientific article; zbMATH DE number 7268456

    Statements

    A Convex Programming Approach for Discrete-Time Markov Decision Processes under the Expected Total Reward Criterion (English)
    0 references
    0 references
    0 references
    0 references
    30 October 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    Markov decision process
    0 references
    expected total reward criterion
    0 references
    occupation measure
    0 references
    constraints
    0 references
    convex program
    0 references
    0 references
    0 references