How to choose the best twins

DOI10.1137/09076845XzbMATH Open1247.60056OpenAlexW2039516355MaRDI QIDQ2902908FDOQ2902908

Authors: Bryn Garrod, Michał Morayne, Grzegorz Kubicki 

Publication date: 22 August 2012

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/09076845x

Recommendations

• A new look at the returning secretary problem
• SELECTING SATISFACTORY SECRETARIES
• On Multiple Choice Secretary Problems
• scientific article; zbMATH DE number 4033475
• Recognizing the three best of a sequence

zbMATH Keywords

partial ordersecretary problembest choice

Mathematics Subject Classification ID

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

Cited In (10)

• The best choice problem for a union of two linear orders with common maximum
• The multi-returning secretary problem
• A new look at the returning secretary problem
• The best choice problem for posets; colored complete binary trees
• Percolation and best-choice problem for powers of paths
• Two measures of efficiency for the secretary problem with multiple items at each rank
• The secretary problem on an unknown poset
• From directed path to linear order -- the best choice problem for powers of directed path
• The best choice problem for upward directed graphs
• Monotone Case for an Extended Process

This page was built for publication: How to choose the best twins

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