DISCRETE DYNAMIC PROGRAMMING WITH A SMALL INTEREST RATE.

Abstract

In a fundamental paper on stationary finite state and action Markovian decision processes, Blackwell defines an optimal policy to be one that maximizes the expected total discounted rewards for all sufficiently small interest rates rho > 0. He also establishes the existence of a stationary optimal policy by a limit process that does not give a finite algorithm. The purpose of this paper is to prove this result constructively by devising a finite policy improvement method for finding stationary optimal policies. The algorithm is based on a new representation of the vector of expected discounted returns under a stationary policy as a power series in the interest rate for all small enough rho > 0. (Author)

Document Details

Document Type
Technical Report
Publication Date
May 31, 1968
Accession Number
AD0673225

Entities

People

  • Arthur F. Veinott Jr.
  • Bruce L. Miller

Organizations

  • Stanford University

Tags

Communities of Interest

  • Energy and Power Technologies
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Contracts
  • Cooperation
  • Dynamic Programming
  • Evolutionary Algorithms
  • Heuristic Methods
  • Mathematics
  • Power Series
  • Stationary

Readers

  • Mathematical Modeling and Probability Theory.