Scholarlink

In this chapter we consider the subclass of MDPs studied in Chap. 2 with convex action sets and convex cost functions. We show that if cost functions are strictly convex, then minimizing Markov actions are unique and that most in the sense of Baire category cost functions are in fact strictly convex.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Convex Markov Decision Processes

  • 章节

  • 发表日期：

    2025年

查看全文
  • Alexander J. Zaslavski

摘要

In this chapter we consider the subclass of MDPs studied in Chap. 2 with convex action sets and convex cost functions. We show that if cost functions are strictly convex, then minimizing Markov actions are unique and that most in the sense of Baire category cost functions are in fact strictly convex.