@Article{JMS-57-476,
author = {Nguyen , GiangvuthanhXu , Xiang and Zhao , Yanxiang},
title = {Analytic Insights into an Adapted Algorithm for the Score-Based Secretary Problem},
journal = {Journal of Mathematical Study},
year = {2024},
volume = {57},
number = {4},
pages = {476--485},
abstract = {<p style="text-align: justify;">In this paper, we study some basic analytic properties of a sequence of functions $\{S^{\mu,σ}_n\}$ that is directly derived in an adaptive algorithm originating from the classical score-based secretary problem. More specifically, we show that: 1. the uniqueness
of maximum points of the function sequence $\{S^{\mu,σ}_n\};$ 2. the maximum point sequence
of $\{S^{\mu,σ}_n\}$ monotone increases to infinity as $n$ tends to infinity. All of the proofs are
elementary but nontrivial.</p>},
issn = {2617-8702},
doi = {https://doi.org/10.4208/jms.v57n4.24.05},
url = {http://global-sci.org/intro/article_detail/jms/23713.html}
}