scientific article; zbMATH DE number 7378319

DOI10.4230/LIPICS.MFCS.2018.2MaRDI QIDQ5005097zbMATH OpenFDO

Authors Mikhail Andreev, Gleb Posobin, A. Shen

Publication date 4 August 2021

Full work available at URL https://arxiv.org/abs/1708.08100

zbMATH Keywords

algorithmic information theoryKolmogorov complexitystopping time complexitystructured conditional complexity

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Conditional optimal stopping: a time-inconsistent optimization
• On stopping times and stochastic monotonicity
• The optimal stopping problem revisited
• scientific article; zbMATH DE number 4108650
• scientific article; zbMATH DE number 3994660
• On time-inconsistent stopping problems and mixed strategy stopping times
• Optimal stopping problems with restricted stopping times

Cites work

• Algorithmic complexity bounds on future prediction errors
• Around Kolmogorov complexity: basic notions and results
• scientific article; zbMATH DE number 3930881 (Why is no real title available?)
• Relations between varieties of kolmogorov complexities

Cited in

(3)

• Anytime algorithms for non-ending computations
• The entropy of a randomly stopped sequence
• Plain stopping time and conditional complexities revisited

This page was built for publication:

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