Year: 2024
Type: article
Abstract: 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.
Source: Journal of Mathematical Study
Authors: Giangvuthanh Nguyen, Xiang Xu, Yanxiang Zhao
Institutions: Old Dominion University, George Washington University
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4405882700