The Secretary Problem with a Choice Function

DOI10.1007/978-3-662-48971-0_12MaRDI QIDQ3459856zbMATH OpenOpenAlexFDO

Authors Yasushi Kawase

Publication date 11 January 2016

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-48971-0_12

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Decision theory (91B06) Randomized algorithms (68W20) Combinatorial optimization (90C27) Stopping times; optimal stopping problems; gambling theory (60G40)

Recommendations

• The d choice secretary problem
• The Secretary Problem with Optimal Assignment
• scientific article; zbMATH DE number 3947461
• A generalized secretary problem
• Selecting the best choice in the weighted secretary problem
• The Secretary Problem and Its Extensions: A Review
• scientific article; zbMATH DE number 1766760

Cited in

(10)

• Stable secretaries
• Antimatroids induced by matchings
• On Multiple Choice Secretary Problems
• Building a good team: secretary problems and the supermodular degree
• Matroidal choice functions
• The secretary problem on an unknown poset
• The secretary recommendation problem
• A secretary problem with two decision makers
• Secretary problem: graphs, matroids and greedoids
• Selecting the best choice in the weighted secretary problem

This page was built for publication: The Secretary Problem with a Choice Function

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