Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Countable state MDPs with a stopping time constraint

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

zbMATH Open1284.90092MaRDI QIDQ4647976FDOQ4647976


Authors: Masayuki Horiguchi Edit this on Wikidata


Publication date: 8 November 2012





Recommendations

  • Markov decision processes with a stopping time constraint
  • Stopped Markov decision processes with multiple constraints
  • scientific article; zbMATH DE number 2196463
  • Constrained Discounted Dynamic Programming
  • Constrained Undiscounted Stochastic Dynamic Programming


zbMATH Keywords

mathematical programming formulationcountable state spaceconstrained stopping timestopped Markov decision process


Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Markov and semi-Markov decision processes (90C40)



Cited In (5)

  • Markov decision processes with a stopping time constraint
  • Stopped Markov decision processes with multiple constraints
  • Stopped decision processes in conjunction with general utility
  • Title not available (Why is that?)
  • Title not available (Why is that?)





This page was built for publication: Countable state MDPs with a stopping time constraint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4647976)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4647976&oldid=18839117"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 16:10. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki