Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Constrained denumerable state non-stationary MDPs with expected total reward criterion

From MaRDI portal
Publication:1568256
Jump to:navigation, search

DOI10.1007/BF02677681zbMath0971.90102OpenAlexW2327640825MaRDI QIDQ1568256

Xianping Guo

Publication date: 21 June 2000

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02677681


zbMATH Keywords

non-stationary Markov decision processesexpected total reward criterionMarkov policyconstrained optimal policies


Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40)


Related Items (1)

Constrained Markov decision processes with first passage criteria



Cites Work

  • On discounted dynamic programming with constraints
  • Optimal policies for controlled Markov chains with a constraint
  • Finite state Markovian decision processes
  • Markov Decision Problems and State-Action Frequencies
  • Constrained Discounted Markov Decision Chains
  • Constrained Undiscounted Stochastic Dynamic Programming
  • Controlled Markov processes on the infinite planning horizon: Weighted and overtaking cost criteria
  • Asymptotic properties of constrained Markov Decision Processes
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Constrained denumerable state non-stationary MDPs with expected total reward criterion

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1568256&oldid=13849984"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 02:17.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki