Dynamic threshold strategy for universal best choice problem

MaRDI QIDQ2959924zbMATH OpenFDO

Authors Jakub Kozik

Publication date 10 February 2017

Full work available at URL http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAM0131

zbMATH Keywords

best-choice problemdynamic threshold strategypartial ordersecretary problem

Mathematics Subject Classification ID

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

Recommendations

• On a universal best choice algorithm for partially ordered sets
• Simulations of thresholds in multiple best choice problem
• The best choice problem with random arrivals: how to beat the \(1 / e\)-strategy
• The best choice problem for a union of two linear orders with common maximum
• The best-choice problem for partially ordered objects.

Cited in

(9)

• The best choice problem for upward directed graphs
• Maximizing the expected number of components in an online search of a graph
• The best choice problem for a union of two linear orders with common maximum
• Monotone Case for an Extended Process
• On a universal best choice algorithm for partially ordered sets
• Percolation and best-choice problem for powers of paths
• From directed path to linear order -- the best choice problem for powers of directed path
• Optimal stopping for many connected components in a graph
• Analytic insights into an adapted algorithm for the score-based secretary problem

This page was built for publication: Dynamic threshold strategy for universal best choice problem

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