The best choice problem for a union of two linear orders with common maximum

DOI10.1016/J.DAM.2013.06.026zbMATH Open1309.60041OpenAlexW2049014303WikidataQ115926604 ScholiaQ115926604MaRDI QIDQ2446902FDOQ2446902

Authors: Wojciech Kaźmierczak 

Publication date: 23 April 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.06.026

Recommendations

• scientific article; zbMATH DE number 3928135
• scientific article; zbMATH DE number 4033475
• The best-choice problem for partially ordered objects.
• Small graphs and hypergraphs of given degree and girth
• The secretary problem on an unknown poset

zbMATH Keywords

optimal stoppingsecretary problem

Mathematics Subject Classification ID

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

Cites Work

• Who solved the secretary problem
• A secretary problem with uncertain employment
• Dynamic Programming and Decision Theory
• Optimal selection based on relative rank (the 'Secretary Problem')
• Partially ordered secretaries
• On a universal best choice algorithm for partially ordered sets
• Partial-order analogue of the secretary problem: The binary tree case
• The best-choice problem for partially ordered objects.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recognizing the maximum of a random sequence based on relative rank with backward solicitation
• Title not available (Why is that?)
• A Secretary Problem with Many Lives
• How to choose the best twins
• Dynamic threshold strategy for universal best choice problem
• An upper bound for spherical caps

Cited In (11)

• Secretary problem with hidden information; searching for a high merit candidate
• The best choice problem for posets; colored complete binary trees
• Percolation and best-choice problem for powers of paths
• From directed path to linear order -- the best choice problem for powers of directed path
• Dynamic threshold strategy for universal best choice problem
• On a universal best choice algorithm for partially ordered sets
• Partially ordered secretaries
• Probability of stopping at a nondominated option
• The best-choice problem for partially ordered objects.
• Counting embeddings of rooted trees into families of rooted trees
• Monotone Case for an Extended Process

This page was built for publication: The best choice problem for a union of two linear orders with common maximum

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