An adaptive \(O(\log n)\)-optimal policy for the online selection of a monotone subsequence from a random sample

Given a sequence of \(n\) independent random variables with common continuous distribution, we propose a simple adaptive online policy that selects a monotone increasing subsequence. We show that the expected number of monotone increasing selections made by such a policy is within \(O(\log n)\) of o...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2016-12
Hauptverfasser:	Arlotto, Alessandro, Wei, Yehua, Xie, Xinchang
Format:	Artikel
Sprache:	eng
Schlagworte:	Continuity (mathematics) Independent variables Optimization Random variables
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!