On maximizing the average time at a goal
type: Item
instance of: scholarly article
title: On maximizing the average time at a goal
zbMATH Open document ID: 0537.90095
DOI: 10.1016/0304-4149(84)90010-3
author: Stephen Demko
author: Theodore P. Hill
published in: Stochastic Processes and their Applications
publication date: 1984-01-01T00:00:00Z
full work available at URL: https://digitalcommons.calpoly.edu/rgp_rsr/55
Mathematics Subject Classification ID: 90C40
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 60K15
zbMATH DE Number: 3854832
zbMATH Keywords: gambling
zbMATH Keywords: infinite horizon
zbMATH Keywords: discrete time decision processes
zbMATH Keywords: finite state space
zbMATH Keywords: arbitrary decision sets
zbMATH Keywords: average time spent at a goal
zbMATH Keywords: stationary strategy
zbMATH Keywords: general average reward
MaRDI profile type: Publication
OpenAlex ID: W2030488046
cites work: Optimal decision procedures for finite markov chains. Part I: Examples
cites work: Discounted Dynamic Programming
cites work: A Controlled Finite Markov Chain with an Arbitrary Set of Decisions
cites work: Decision processes with total-cost criteria
cites work: On sequential decisions and Markov chains
cites work: Finite state Markovian decision processes
cites work: Q4131339
cites work: Persistently ϵ-Optimal Strategies
cites work: Q3862198
cites work: Q4169844
cites work: On the Existence of Good Markov Strategies
cites work: Q4771778
cites work: Q3266141
cites work: On the Existence of Stationary Optimal Strategies
cites work: Q5615108
cites work: On dynamic programming: Compactness of the space of policies
cites work: Q4084474
cites work: On the Existence of Good Stationary Strategies
cites work: On Measurable Gambling Problems
description: scientific article; zbMATH DE number 3854832