Skip to main navigation Skip to search Skip to main content

Strongly polynomial algorithms for transient and average-cost MDPs

  • Cornell University

Research output: Contribution to journalConference articlepeer-review

Abstract

This paper considers transient total-cost MDPs with transition rates whose values may be greater than one, and average-cost MDPs satisfying the condition that the expected time to hit a certain state from any initial state and under any stationary policy is bounded above by a constant. Linear programming formulations for such MDPs are provided that are solvable in strongly polynomial time.

Original languageEnglish
Pages (from-to)6-8
Number of pages3
JournalPerformance Evaluation Review
Volume45
Issue number2
DOIs
StatePublished - Sep 1 2017
EventWorkshop on MAthematical Performance Modeling and Analysis, MAMA 2017, 2017 Greenmetrics Workshop and Workshop on Critical Infrastructure Network Security, CINS 2017 - Urbana-Champaign, United States
Duration: Jun 1 2017 → …

Keywords

  • Algorithm
  • Average cost
  • Linear program
  • Markov decision process
  • Total cost
  • Transient

Fingerprint

Dive into the research topics of 'Strongly polynomial algorithms for transient and average-cost MDPs'. Together they form a unique fingerprint.

Cite this