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

The elimination algorithm for the problem of optimal stopping

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

zbMath0935.60021MaRDI QIDQ1299925

Isaac M. Sonin

Publication date: 25 April 2000

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)


zbMATH Keywords

optimal stoppingMarkov chaindiscrete timesecretary problemelimination algorithmsequential analysis discounting


Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40)


Related Items (7)

Solution of Optimal Stopping Problem Based on a Modification of Payoff Function ⋮ Optimal Stopping of Seasonal Observations and Projection of a Markov Chain ⋮ On a duration problem with unbounded geometrical horizon ⋮ A generalized Gittins index for a Markov chain and its recursive calculation ⋮ A model of a 2-player stopping game with priority and asynchronous observation ⋮ Parallel computing for Markov chains with islands and ports ⋮ On the forward algorithm for stopping problems on continuous-time Markov chains







This page was built for publication: The elimination algorithm for the problem of optimal stopping

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