The complete solution of the competitive rank selection problem

DOI10.1007/PL00009232MaRDI QIDQ1277372zbMATH OpenFDO

Authors Michael Drmota, F. Thomas Bruss, Guy Louchard

Publication date 17 August 1999

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/PL00009232

zbMATH Keywords

competitive secretary problemnumerical algorithmrecursive sequencesrelative ranks

Mathematics Subject Classification ID

Probabilistic methods, stochastic differential equations (65C99) Decision theory (91B06)

Recommendations

• Sharp bounds for winning probabilities in the competitive rank selection problem
• scientific article; zbMATH DE number 5823899
• scientific article; zbMATH DE number 1143633
• scientific article; zbMATH DE number 1117672

Cited in

(5)

• Taking turns
• Analysis of a Recurrence Related to Critical Nonhomogeneous Branching Processes
• Sharp bounds for winning probabilities in the competitive rank selection problem
• Recursive Construction of a Nash Equilibrium in a Two-Player Nonzero-Sum Stopping Game with Asymmetric Information
• The Generalized Stackelberg Equilibrium of the Two-Person Stopping Game

This page was built for publication: The complete solution of the competitive rank selection problem

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