A Convex Programming Approach for Discrete-Time Markov Decision Processes under the Expected Total Reward Criterion (Q5130923): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:12, 8 February 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
30 October 2020
0 references
Markov decision process
0 references
expected total reward criterion
0 references
occupation measure
0 references
constraints
0 references
convex program
0 references
