Abstract

This report presents a unified approach for the study of constrained Markov decision processes with a countable state space and unbounded costs. We consider a single controller having several objectives; it is desirable to design a controller that minimize one of cost objective, subject to inequality constraints on other cost objectives. The objectives that we study are both the expected average cost, as well as the expected total cost (of which the discounted cost is a special case). We provide two frameworks: the case were costs are bounded below, as well as the contracting framework. We characterize the set of achievable expected occupation measures as well as performance vectors. This allows us to reduce the original control dynamic problem into an infinite Linear Programming. We present a Lagrangian approach that enables us to obtain sensitivity analysis. In particular, we obtain asymptotical results for the constrained control problem: convergence of both the value and the pol...

Keywords

Mathematical optimizationMarkov decision processDiscountingCountable setState spaceBounded functionDynamic programmingMarkov processAverage costBellman equationComputer scienceTime horizonMathematicsOptimal controlController (irrigation)

Related Publications

Publication Info

Year
2021
Type
book
Citations
1412
Access
Closed

External Links

Social Impact

Altmetric

Social media, news, blog, policy document mentions

Citation Metrics

1412
OpenAlex

Cite This

Eitan Altman (2021). Constrained Markov Decision Processes. . https://doi.org/10.1201/9781315140223

Identifiers

DOI
10.1201/9781315140223