A convex analytic approach to Markov decision processes (Q1093563): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5560061 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dynamic programming and stochastic control / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Minimum Cost Per Unit Time Control of Markov Chains / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5508589 / rank | |||
Normal rank |
Revision as of 11:58, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A convex analytic approach to Markov decision processes |
scientific article |
Statements
A convex analytic approach to Markov decision processes (English)
0 references
1988
0 references
This paper develops a new framework for the study of Markov decision processes in which the control problem is viewed as an optimization problem on the set of canonically induced measures on the trajectory space of the joint state and control process. This set is shown to be compact convex. One then associates with each of the usual cost criteria (infinite horizon discounted cost, finite horizon, control up to an exit time) a naturally defined occupation measure such that the cost is an integral of some function with respect to this measure. These measures are shown to form a compact convex set whose extreme points are characterized. Classical results about existence of optimal strategies are recovered from this and several applications to multicriteria and constrained optimization problems are briefly indicated.
0 references
canonically induced measures
0 references
optimization in measure space
0 references
occupation measure
0 references
existence of optimal strategies
0 references
multicriteria
0 references
constrained optimization
0 references