Continue, quit, restart probability model

DOI10.1007/S10479-012-1089-2MaRDI QIDQ333092zbMATH OpenOpenAlexFDO

Authors Isaac Sonin, Constantine Steinberg

Publication date 9 November 2016

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-012-1089-2

zbMATH Keywords

Markov chainGittins indexoptimal stoppingelimination algorithm

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Stopping times; optimal stopping problems; gambling theory (60G40) Markov and semi-Markov decision processes (90C40)

Recommendations

• Optimal stopping of Markov chains and three abstract optimization problems
• Optimal retrial policies for restrained markov chains
• On a sequential two-action decision model¹with unbounded reward functions
• Markov processes with restart
• Optimal stopping model with unknown transition probabilities

Cites work

• scientific article; zbMATH DE number 4131489 (Why is no real title available?)
• scientific article; zbMATH DE number 3687126 (Why is no real title available?)
• scientific article; zbMATH DE number 5685899 (Why is no real title available?)
• scientific article; zbMATH DE number 5066282 (Why is no real title available?)
• scientific article; zbMATH DE number 3240812 (Why is no real title available?)
• A generalized Gittins index for a Markov chain and its recursive calculation
• A short proof of the Gittins index theorem
• Bayesian models in actuarial mathematics
• Continue, quit, restart probability model
• Finite state Markovian decision processes
• Handbook of Markov decision processes. Methods and applications
• Index Policies for Stochastic Search in a Forest with an Application to R&D Project Management
• On the best choice problem with random population size
• Optimal stopping of Markov chains and three abstract optimization problems
• Probability, Markov chains, queues, and simulation. The mathematical basis of performance modeling.
• Recursive algorithm for the fundamental group inverse matrix of a Markov chain from an explicit formula
• Regenerative Analysis and Steady State Distributions for Markov Chains
• State reduction in a Markov decision process
• The Best Choice Problem for a Random Number of Objects
• The Multi-Armed Bandit Problem: Decomposition and Computation
• The simplex and policy-iteration methods are strongly polynomial for the Markov decision problem with a fixed discount rate
• The state reduction and related algorithms and their applications to the study of Markov chains, graph theory, and the optimal stopping problem

Cited in

(5)

• Multi-armed bandits under general depreciation and commitment
• Optimal activation of halting multi‐armed bandit models
• Parallel computing for Markov chains with islands and ports
• Continue, quit, restart probability model
• Optimal stopping of Markov chains and three abstract optimization problems

This page was built for publication: Continue, quit, restart probability model

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